1244 search results - page 66 / 249 » Cluster Based Personalized Search |
119
Voted
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
133
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
155
click to vote
JCDL
2006
ACM
15 years 10 months ago
2006
ACM
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
125
Voted
ICDE
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
148
click to vote
COLING
2010
14 years 11 months ago
2010
A new approach has been developed for acquiring bilingual web pages from the result pages of search engines, which is composed of two challenging tasks. The first task is to detec...