Sciweavers

25 search results - page 5 / 5
» Itemset Support Queries Using Frequent Itemsets and Their Co...
Sort
View
DKE
2002
218views more  DKE 2002»
13 years 8 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
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 9 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
KES
2008
Springer
13 years 8 months ago
Data Mining for Navigation Generating System with Unorganized Web Resources
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
Diana Purwitasari, Yasuhisa Okazaki, Kenzi Watanab...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 8 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
SAC
2010
ACM
14 years 3 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil