Sciweavers

12551 search results - page 2379 / 2511
» Informative Discriminant Analysis
Sort
View
PODC
2009
ACM
16 years 5 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
KDD
2009
ACM
211views Data Mining» more  KDD 2009»
16 years 5 months ago
Address standardization with latent semantic association
Address standardization is a very challenging task in data cleansing. To provide better customer relationship management and business intelligence for customer-oriented cooperates...
Honglei Guo, Huijia Zhu, Zhili Guo, Xiaoxun Zhang,...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 5 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
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 5 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 4 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
« Prev « First page 2379 / 2511 Last » Next »