Name
Abstract | ||
|---|---|---|
Association rules discovery is an important data mining technique which usually produces large number of rules. Subset and Superset queries are common queries for association rules. We introduce a new index structure (SSST) for querying association rules, based on a unique set representation using a hierarchical structure. It supports both Subset and Superset queries. Further, it is scalable and adapts to different types of data. The performance of SSST is evaluated using real as well as synthetic datasets, spanning dense and sparse data. The experiments showed that the proposed structure outperforms other set indexing techniques significantly, especially for dense datasets. Also, it scales well with both the number of association rules and the query size. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/AINA.2006.41 | AINA |
Keywords | Field | DocType |
indexing,database languages,data mining,degradation,data analysis,data engineering,set theory,association rules,query languages,sparse data,genomics,association rule,indexation | Set theory,Data mining,Subset and superset,Query language,Computer science,Search engine indexing,Association rule learning,Data type,Information engineering,Sparse matrix | Conference |
Volume | ISBN | Citations |
2 | 0-7695-2466-4-02 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaimaa Lazem | 1 | 27 | 3.06 |
| Noha Adly | 2 | 20 | 4.65 |
| Magdy Nagi | 3 | 9 | 3.95 |