Sciweavers

322 search results - page 3 / 65
» Mining Frequent Tree-Like Patterns in Large Datasets
Sort
View
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
13 years 10 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
KDD
2003
ACM
145views Data Mining» more  KDD 2003»
14 years 6 months ago
Carpenter: finding closed patterns in long biological datasets
The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example,...
Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 12 days ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
IDEAS
2006
IEEE
98views Database» more  IDEAS 2006»
14 years 8 days ago
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 6 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...