Sciweavers

927 search results - page 56 / 186
» Stability of k -Means Clustering
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering
Abstract— Large-scale ubiquitous computing environments require scalable and robust service discovery to enable “anytime, anywhere” computing, which is hard to be satisfied ...
Wei Gao
IEEECIT
2009
IEEE
14 years 2 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
ICASSP
2011
IEEE
12 years 11 months ago
Using clustering comparison measures for speaker recognition
Recent results seem to cast some doubt over the assumption that improvements in fused recognition accuracy for speaker recognition systems based on different acoustic features are...
Jia Min Karen Kua, Julien Epps, Mohaddeseh Nosrati...
PR
2008
170views more  PR 2008»
13 years 7 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ATAL
2006
Springer
13 years 12 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer