Sciweavers

174 search results - page 33 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
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
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...
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
14 years 8 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
PKDD
2010
Springer
124views Data Mining» more  PKDD 2010»
13 years 6 months ago
Summarising Data by Clustering Items
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
Michael Mampaey, Jilles Vreeken
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
14 years 27 days ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee