Sciweavers

95 search results - page 3 / 19
» Efficient Clustering with Limited Distance Information
Sort
View
PAKDD
2009
ACM
186views Data Mining» more  PAKDD 2009»
14 years 1 months ago
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
Su Yan, Hai Wang, Dongwon Lee, C. Lee Giles
CCR
2002
98views more  CCR 2002»
13 years 6 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
VTC
2007
IEEE
117views Communications» more  VTC 2007»
14 years 15 days ago
Hop Distance Based Routing Protocol for MANET
—The Hop Distance based Routing Protocol (HDR) is an on-demand based routing protocol suited for mobile ad hoc networks integrated with wired networks. HDR considers an efficient...
Filip Cuckov, Min Song
ICML
2003
IEEE
14 years 7 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...
IDEAL
2010
Springer
13 years 4 months ago
An Efficient Approach to Clustering Real-Estate Listings
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...
Maciej Grzenda, Deepak Thukral