1314 search results - page 200 / 263 » Approximate data mining in very large relational data |
131
click to vote
DATAMINE
2006
15 years 4 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
133
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
We are experiencing an unprecedented increase of content contributed by users in forums such as blogs, social networking sites and microblogging services. Such abundance of conten...
135
click to vote
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
159
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
141
click to vote
KDD
2001
ACM
16 years 4 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...