Sciweavers

2932 search results - page 86 / 587
» Higher order mining
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 5 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 5 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 5 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
KDD
2002
ACM
130views Data Mining» more  KDD 2002»
16 years 5 months ago
Learning domain-independent string transformation weights for high accuracy object identification
The task of object identification occurs when integrating information from multiple websites. The same data objects can exist in inconsistent text formats across sites, making it ...
Sheila Tejada, Craig A. Knoblock, Steven Minton
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
15 years 11 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...