Improved Growth Algorithm Mining by Singh Kuldeep (5 results)
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 55.03
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 56 pages. 8.66x5.91x0.13 inches. In Stock.
- More images
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 27.84
£ 59.78 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Improved FP Growth Algorithm for Mining Association Rules | Kuldeep Singh (u. a.) | Taschenbuch | 56 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9783330341906 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de |…Anbieter: preigu.
- More images
Language: English
Published by LAP LAMBERT Academic Publishing Jun 2017, 2017
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 31.58
£ 19.64 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Mining frequent patterns (itemsets) plays an important role of in discovering association rules. However, finding frequent itemsets is most expensive step in the process of association rule mining. Very often algorithms to find freq…uent itemsets need multiple database scans creating a bottle-neck to achieve efficiency. To avoid this bottle-neck the objective has been to reduce database scans. In the past, Apriori-like methods were adopted to mine frequent itemsets. But these approaches are inefficient as they require multiple database scans and iteratively check a large set of candidates by pattern matching. A compact structure, called FP-Tree, was developed to improve the disadvantages of Apriori-like algorithms. By FP-Growth approach, we can facilitate mining frequent itemsets. This book proposes an Improved FP-Growth algorithm that scans database only once for association rule mining. The original FP-Growth algorithm scans datasets twice. First time, scanning database to find the frequent 1-itemsets, and sorting the 1-itemsets in the descending order of support and second time it scans the database again to construct FP-tree. 56 pp. Englisch.
- More images
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 27.51
£ 41.84 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Singh KuldeepMr. Kuldeep Singh is currently pursuing his PhD in the dept. of CSE from IIT (BHU) Varanasi, India. His research interest includes high utility pattern mining, social network analysis and d…ata mining. He received his M.T.
- More images
Language: English
Published by LAP LAMBERT Academic Publishing Jun 2017, 2017
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 31.58
£ 51.24 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Mining frequent patterns (itemsets) plays an important role of in discovering association rules. However, finding frequent itemsets is most expensive step in the process of association rule mining. Very often algorithms to find frequent… itemsets need multiple database scans creating a bottle-neck to achieve efficiency. To avoid this bottle-neck the objective has been to reduce database scans. In the past, Apriori-like methods were adopted to mine frequent itemsets. But these approaches are inefficient as they require multiple database scans and iteratively check a large set of candidates by pattern matching. A compact structure, called FP-Tree, was developed to improve the disadvantages of Apriori-like algorithms. By FP-Growth approach, we can facilitate mining frequent itemsets. This book proposes an Improved FP-Growth algorithm that scans database only once for association rule mining. The original FP-Growth algorithm scans datasets twice. First time, scanning database to find the frequent 1-itemsets, and sorting the 1-itemsets in the descending order of support and second time it scans the database again to construct FP-tree.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch.
