Sciweavers

9842 search results - page 1910 / 1969
» The Complexity of the Matching-Cut Problem
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
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Mining for misconfigured machines in grid systems
Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well known example for that is Intel which uses an internally developed sy...
Noam Palatin, Arie Leizarowitz, Assaf Schuster, Ra...
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 8 months ago
Tumor cell identification using features rules
Advances in imaging techniques have led to large repositories of images. There is an increasing demand for automated systems that can analyze complex medical images and extract me...
Bin Fang, Wynne Hsu, Mong-Li Lee
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 8 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
CHI
2007
ACM
14 years 8 months ago
Work-centered design: a case study of a mixed-initiative scheduler
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
Keith A. Butler, Jiajie Zhang, Chris Esposito, Ali...
« Prev « First page 1910 / 1969 Last » Next »