FP-tree and COFI based Approach for Mining of Multiple Level Association Rules in Large Databases
| Autor: | Virendra Kumar Shrivastava, K. R. Pardasani, Parveen Kumar |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
FOS: Computer and information sciences
Structure (mathematical logic) Tree (data structure) Association rule learning Database Computer Science - Other Computer Science Computer science Process (engineering) Other Computer Science (cs.OH) InformationSystems_DATABASEMANAGEMENT Concept hierarchy computer.software_genre computer |
| Zdroj: | Proceedings of the International Conference on Computer Applications — Database Systems. |
| DOI: | 10.3850/978-981-08-7300-4_0634 |
| Popis: | In recent years, discovery of association rules among itemsets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received considerable research attention and several algorithms for mining frequent itemsets have been developed. Many algorithms have been proposed to discover rules at single concept level. However, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. The discovery of multiple level association rules is very much useful in many applications. In most of the studies for multiple level association rule mining, the database is scanned repeatedly which affects the efficiency of mining process. In this research paper, a new method for discovering multilevel association rules is proposed. It is based on FP-tree structure and uses cooccurrence frequent item tree to find frequent items in multilevel concept hierarchy. Comment: Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947 5500, http://sites.google.com/site/ijcsis/ |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|