Sciweavers

247 search results - page 16 / 50
» On Finding Large Conjunctive Clusters
Sort
View
ICML
2008
IEEE
14 years 8 months ago
A rate-distortion one-class model and its applications to clustering
In one-class classification we seek a rule to find a coherent subset of instances similar to a few positive examples in a large pool of instances. The problem can be formulated an...
Koby Crammer, Partha Pratim Talukdar, Fernando Per...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
BMCBI
2008
160views more  BMCBI 2008»
13 years 7 months ago
A comparison of four clustering methods for brain expression microarray data
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
Alexander L. Richards, Peter Holmans, Michael C. O...
AUSAI
2003
Springer
14 years 24 days ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
AAAI
2006
13 years 9 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi