553 search results - page 39 / 111 » A Compress-Based Association Mining Algorithm for Large Data... |
103
click to vote
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
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...
BMCBI
2008
14 years 10 months ago
2008
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...