Sciweavers

237 search results - page 33 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 9 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
Real world performance of association rule algorithms
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improve...
Zijian Zheng, Ron Kohavi, Llew Mason
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 7 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
DAWAK
2005
Springer
14 years 1 months ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...