195 search results - page 18 / 39 » Clustering-Based K-Anonymisation Algorithms |
IJIS
2007
14 years 9 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
83
Voted
PIMRC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
114
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
121
click to vote
JCB
2002
14 years 9 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
101
Voted
DEXAW
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider topic detection without any prior knowledge of category structure or possible categories. Keywords are extracted and clustered based on different similarity measures u...