Sciweavers

87 search results - page 12 / 18
» Mining Frequent Generalized Itemsets and Generalized Associa...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
PARMA
2004
191views Database» more  PARMA 2004»
13 years 9 months ago
Identifying Most Predictive Items
Abstract. Frequent itemsets and association rules are generally accepted concepts in analyzing item-based databases. The Apriori-framework was developed for analyzing categorical d...
Markus Wawryniuk, Daniel A. Keim
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 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
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
CIKM
2004
Springer
14 years 1 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...