tree based algorithms incremental utility de lin jerry (6 résultats)

Taschenbuch. Etat : Neu. Tree-based Algorithms for Incremental, Utility, and Fuzzy Data Mining | Jerry Chun-Wei Lin | Taschenbuch | 172 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659677229 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the first part of this book, three Pre-FUFP maintenance algorithms are thus proposed to efficiently maintain and update the FUFP-tree structures regardless of whether records are inserted, deleted or modified in dynamic databases. In the second part of this book, a novel HUP-tree algorithm is proposed to efficiently mine the high utility itemsets based on the downward closure property. A HUP tree is first designed to keep the related information for later mining process. A HUP-growth mining algorithm is then presented to efficiently mine high utility itemsets from it. In the third part of this book, we attempt to extend the FP-tree algorithm for handling quantitative data from the global values of fuzzy regions. Thus, the fuzzy FP-tree algorithm, the compressed fuzzy frequent pattern tree (CFFP-tree) algorithm, and the upper-bound fuzzy frequent pattern tree (UBFFP-tree) algorithm are then proposed to efficiently mine the fuzzy frequent itemsets. 172 pp. Englisch.

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Lin Jerry Chun-WeiJerry Chun-Wei Lin is currently an Assistant Professor at School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, China. His research interests include data mining, machin.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -In the first part of this book, three Pre-FUFP maintenance algorithms are thus proposed to efficiently maintain and update the FUFP-tree structures regardless of whether records are inserted, deleted or modified in dynamic databases. In the second part of this book, a novel HUP-tree algorithm is proposed to efficiently mine the high utility itemsets based on the downward closure property. A HUP tree is first designed to keep the related information for later mining process. A HUP-growth mining algorithm is then presented to efficiently mine high utility itemsets from it. In the third part of this book, we attempt to extend the FP-tree algorithm for handling quantitative data from the global values of fuzzy regions. Thus, the fuzzy FP-tree algorithm, the compressed fuzzy frequent pattern tree (CFFP-tree) algorithm, and the upper-bound fuzzy frequent pattern tree (UBFFP-tree) algorithm are then proposed to efficiently mine the fuzzy frequent itemsets.Books on Demand GmbH, Überseering 33, 22297 Hamburg 172 pp. Englisch.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In the first part of this book, three Pre-FUFP maintenance algorithms are thus proposed to efficiently maintain and update the FUFP-tree structures regardless of whether records are inserted, deleted or modified in dynamic databases. In the second part of this book, a novel HUP-tree algorithm is proposed to efficiently mine the high utility itemsets based on the downward closure property. A HUP tree is first designed to keep the related information for later mining process. A HUP-growth mining algorithm is then presented to efficiently mine high utility itemsets from it. In the third part of this book, we attempt to extend the FP-tree algorithm for handling quantitative data from the global values of fuzzy regions. Thus, the fuzzy FP-tree algorithm, the compressed fuzzy frequent pattern tree (CFFP-tree) algorithm, and the upper-bound fuzzy frequent pattern tree (UBFFP-tree) algorithm are then proposed to efficiently mine the fuzzy frequent itemsets.