Sciweavers

88 search results - page 13 / 18
» A new method for finding generalized frequent itemsets in ge...
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 12 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
AEI
2007
91views more  AEI 2007»
13 years 7 months ago
MICF: An effective sanitization algorithm for hiding sensitive patterns on data mining
Data mining mechanisms have widely been applied in various businesses and manufacturing companies across many industry sectors. Sharing data or sharing mined rules has become a tr...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
CIKM
2005
Springer
14 years 1 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 7 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 2 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