Sciweavers

5221 search results - page 826 / 1045
» An On-line Problem Database
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 7 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
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
16 years 7 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin