DocumentCode
2370172
Title
A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns
Author
Bailey, James ; Manoukian, Thomas ; Ramamohanarao, Kotagiri
Author_Institution
Dept. of Comput. Sci. & Software Eng., Melbourne Univ., Vic., Australia
fYear
2003
fDate
19-22 Nov. 2003
Firstpage
485
Lastpage
488
Abstract
Computing the minimal transversals of a hypergraph is an important problem in computer science that has significant applications in data mining. We present a new algorithm for computing hypergraph transversals and highlight their close connection to an important class of patterns known as emerging patterns. We evaluate our technique on a number of large datasets and show that it outperforms previous approaches by a factor of 9-29 times.
Keywords
computational complexity; data mining; graph theory; minimisation; very large databases; computer science; data mining; emerging patterns; minimal hypergraph transversals; Application software; Computer science; Data mining; Frequency; Itemsets; Mathematics; Partitioning algorithms; Software algorithms; Software engineering;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, 2003. ICDM 2003. Third IEEE International Conference on
Print_ISBN
0-7695-1978-4
Type
conf
DOI
10.1109/ICDM.2003.1250958
Filename
1250958
Link To Document