Sciweavers

79 search results - page 15 / 16
» Disjoint pattern database heuristics
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
15 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
KDD
2004
ACM
171views Data Mining» more  KDD 2004»
15 years 10 months ago
Integrating Web Conceptual Modeling and Web Usage Mining
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Robe...
ICDCS
2002
IEEE
15 years 2 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
SSDBM
2006
IEEE
163views Database» more  SSDBM 2006»
15 years 3 months ago
ACache: Using Caching to Improve the Performance of Multiple Sequence Alignments
Multiple sequence alignment represents a class of powerful bioinformatics tools with many uses in computational biology ranging from discovery of characteristic motifs and conserv...
Xun Tu, Kajal T. Claypool, Cindy X. Chen