Sciweavers

284 search results - page 38 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
DKE
2002
218views more  DKE 2002»
14 years 9 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...
74
Voted
CIKM
2009
Springer
15 years 1 months ago
Mining data streams with periodically changing distributions
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....
Yingying Tao, M. Tamer Özsu
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
15 years 10 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
COMPUTE
2010
ACM
15 years 2 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
APIN
2006
168views more  APIN 2006»
14 years 9 months ago
Utilizing Genetic Algorithms to Optimize Membership Functions for Fuzzy Weighted Association Rules Mining
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
Mehmet Kaya, Reda Alhajj