Sciweavers

16404 search results - page 2897 / 3281
» A set coverage problem
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 7 months ago
DiMaC: a disguised missing data cleaning tool
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
KDD
2008
ACM
159views Data Mining» more  KDD 2008»
16 years 7 months ago
Semi-supervised learning with data calibration for long-term time series forecasting
Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
Haibin Cheng, Pang-Ning Tan
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
« Prev « First page 2897 / 3281 Last » Next »