960 search results - page 172 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
141
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
116
Voted
SNPD
2007
15 years 5 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
173
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Web-page recommendation is to predict the next request of pages that Web users are potentially interested in when surfing the Web. This technique can guide Web users to find more u...
209
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
201
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...