Sciweavers

376 search results - page 33 / 76
» Completely connected clustered graphs
Sort
View
AAAI
2011
12 years 7 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
WSE
2003
IEEE
14 years 29 days ago
Using Keyword Extraction for Web Site Clustering
Reverse engineering techniques have the potential to support Web site understanding, by providing views that show the organization of a site and its navigational structure. Howeve...
Paolo Tonella, Filippo Ricca, Emanuele Pianta, Chr...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
COLT
2007
Springer
14 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
IPPS
2006
IEEE
14 years 1 months ago
Fault and intrusion tolerance of wireless sensor networks
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
Liang-min Wang, Jianfeng Ma, Chao Wang, A. C. Kot