Sciweavers

1110 search results - page 13 / 222
» Clustering with the Connectivity Kernel
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 2 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
SDM
2004
SIAM
218views Data Mining» more  SDM 2004»
13 years 9 months ago
Mixture Density Mercer Kernels: A Method to Learn Kernels Directly from Data
This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian mixture density e...
Ashok N. Srivastava
NN
2006
Springer
128views Neural Networks» more  NN 2006»
13 years 7 months ago
Topographic map formation of factorized Edgeworth-expanded kernels
We introduce a new learning algorithm for topographic map formation of Edgeworth-expanded Gaussian activation kernels. In order to avoid the rapid increase in kernel parameters, a...
Marc M. Van Hulle