Sciweavers

942 search results - page 98 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
14 years 11 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
MASCOTS
2010
14 years 11 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
SAC
2004
ACM
15 years 3 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo