Sciweavers

2005 search results - page 371 / 401
» Decisive Markov Chains
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 5 days ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 5 days ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 5 days ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
RECOMB
2004
Springer
16 years 2 days ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 9 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki