Sciweavers

618 search results - page 16 / 124
» Aggregated Subset Mining
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 7 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
SIGKDD
2002
93views more  SIGKDD 2002»
13 years 7 months ago
Randomization in Privacy-Preserving Data Mining
Suppose there are many clients, each having some personal information, and one server, which is interested only in aggregate, statistically significant, properties of this informa...
Alexandre V. Evfimievski
DOLAP
2006
ACM
14 years 1 months ago
Enhanced mining of association rules from data cubes
On-line analytical processing (OLAP) provides tools to explore and navigate into data cubes in order to extract interesting information. Nevertheless, OLAP is not capable of expla...
Riadh Ben Messaoud, Sabine Loudcher Rabaséd...