Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Generating association rules from semi-structured documents using an extended concept hierarchy
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining Association Rules from XML Data
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
A Tool for Extracting XML Association Rules
ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Extracting association rules from XML documents using XQuery
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Hi-index | 0.00 |
Because of the widespread interest and use of semi-structured data in XML format, the discovery of useful information from them is currently one of the main research topics on association rule extraction. Several encouraging approaches to developing methods for mining rules from XML data have been proposed. However, efficiency and simplicity are still barriers for further development due to the combinatorial explosion in the number of tree nodes. What is needed is a clear and simple methodology for extracting the knowledge that is hidden in the heterogeneous tree data. In this paper, we show that association rules can be unveiled and provided from any XML documents using a special data structure, called Simple and Effective Lists Structure (SELS), avoiding the computationally intractable problem in the number of nodes. SELS is flexible and powerful enough to represent both simple and complex structured association relationships in XML data.