679 search results - page 85 / 136 » Scaling Clustering Algorithms to Large Databases |
149
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
105
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
124
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
111
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...