Sciweavers

2137 search results - page 69 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ECML
2007
Springer
14 years 1 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski
ICWN
2010
13 years 5 months ago
Efficient Cluster Head Election in Surveillance Reconnaissance Sensor Network
- Using a wireless sensor network, variety applications are being developed. In this paper, considering the field of military surveillance and reconnaissance sensors in the network...
Young Bag Moon, Nae Soo Kim, Cheol Sig Pyo, Keun W...
PAMI
2006
141views more  PAMI 2006»
13 years 7 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 2 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
CCGRID
2008
IEEE
14 years 2 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...