Optimizing subset queries: A step towards SQL-based inductive databases for itemsets

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2004, Pages 535-539

  Masson, Cyrille ^a   Robardet, Céline ^a   Boulicaut, Jean François ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Inductive databases; Itemset post processing

Indexed keywords

BINARY SEQUENCES; COST BENEFIT ANALYSIS; DATA MINING; KNOWLEDGE ACQUISITION; OPTIMIZATION; PARAMETER ESTIMATION; RELATIONAL DATABASE SYSTEMS; SERVERS; SET THEORY;

INDUCTIVE DATABASE APPROACH; INDUCTIVE DATABASES; ITEMSET POST-PROCESSING; SUBSET QUERIES;

QUERY LANGUAGES;

EID: 2442575959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
2. M. Botta, J.-F. Boulicaut, C. Masson, and R. Meo. A comparison between query languages for the extraction of association rules. In Proc. DaWaK'02, LNCS 2454, pages 1-10, 2002.
3. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
4. L. De Raedt. A perspective on inductive databases. SIGKDD Explorations, 4(2):69-77, January 2003.
5. A. Hafez, J. S. Deogun, and V. V. Raghavan. The item-set tree: a data structure for data mining. In Proc. DaWaK'99, LNCS 1676, pages 183-192, 1999.
6. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, Nov. 1996.
7. R. Meo, G. Psaila, and S. Ceri. An extension to SQL for mining association rules. Data Mining and Knowledge Discovery, 2(2):195-224, 1998.
8. T. Morzy and M. Zakrzewicz. Group bitmap index: a structure for association rules retrieval. In Proc. ACM SIGKDD'98, pages 284-288, 1998.
9. J. Pei, J. Han, and R. Mao. CLOSET an efficient algorithm for mining frequent closed itemsets. In Proc. SIGMOD Workshop DMKD'00, 2000.
10. R. Rantzau. Frequent itemset discovery with sql using a vertical layout and universal quantification. In Proc. EDBT Workshop DTDM'02, Praha, CZ, 2002.
11. S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. Data Mining and Knowledge Discovery, 4(2-3):89-125, 2000.
12. A. Tuzhilin and G. Adomavicius. Handling very large numbers of association rules in the analysis of microarray data. In Proc. SIGKDD'02, 2002.
13. A. Tuzhilin and B. Liu. Querying multiple sets of discovered rules. In Proc. ACM SIGKDD'02, 2002.
14. M. J. Zaki. Generating non-redundant association rules. In Proc. SIGKDD'00, pages 34-43, 2000.