Sciweavers

680 search results - page 27 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 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
IS
2007
14 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
92
Voted
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 10 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 10 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...