Sciweavers

728 search results - page 78 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 8 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 5 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
CIKM
2004
Springer
14 years 1 months ago
Optimizing web search using web click-through data
The performance of web search engines may often deteriorate due to the diversity and noisy information contained within web pages. User click-through data can be used to introduce...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Yong Yu, W...
KDD
1997
ACM
96views Data Mining» more  KDD 1997»
13 years 12 months ago
Using General Impressions to Analyze Discovered Classification Rules
One of the important problems in data mining is the evaluation of subjective interestingness of the discovered rules. Past research has found that in many real-life applications i...
Bing Liu, Wynne Hsu, Shu Chen
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li