A weighted frequent itemset mining algorithm for intelligent decision in smart systems
| Autor: | Xinhui Zhang, Zhixin Sun, Songle Chen, Pan Wang, Xuejian Zhao |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
downward closure property
General Computer Science Association rule learning Computer science Property (programming) 02 engineering and technology Space (commercial competition) computer.software_genre Data modeling 020204 information systems smart system 0202 electrical engineering electronic engineering information engineering General Materials Science Smart system General Engineering InformationSystems_DATABASEMANAGEMENT intelligent decision data mining Data set Statistical classification weight judgment Key (cryptography) 020201 artificial intelligence & image processing Frequent itemset mining lcsh:Electrical engineering. Electronics. Nuclear engineering Data mining lcsh:TK1-9971 computer |
| Zdroj: | IEEE Access, Vol 6, Pp 29271-29282 (2018) |
| ISSN: | 2169-3536 |
| DOI: | 10.1109/access.2018.2839751 |
| Popis: | Intelligent decision is the key technology of smart systems. Data mining technology has been playing an increasingly important role in decision-making activities. Frequent itemset mining (FIM), as an important step of association rule analysis, is becoming one of the most important research fields in data mining. Weighted FIM in uncertain databases should take both existential probability and importance of items into account in order to find frequent itemsets of great importance to users. However, the introduction of weight makes the weighted frequent itemsets not satisfy the downward closure property any longer. As a result, the search space of frequent itemsets cannot be narrowed according to downward closure property which leads to a poor time efficiency. In this paper, the weight judgment downward closure property for the weighted frequent itemsets and the existence property of weighted frequent subsets are introduced and proved first. Based on these two properties, the Weight judgment downward closure property-based FIM (WD-FIM) algorithm is proposed to narrow the searching space of the weighted frequent itemsets and improve the time efficiency. Moreover, the completeness and time efficiency of WD-FIM algorithm are analyzed theoretically. Finally, the performance of the proposed WD-FIM algorithm is verified on both synthetic and real-life data sets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|