960 search results - page 79 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
127
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
133
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
156
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
221
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
151
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...