Sciweavers

2260 search results - page 68 / 452
» A new algorithm for clustering search results
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Select
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
Yiu-ming Cheung
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
14 years 1 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
ICEC
1994
86views more  ICEC 1994»
13 years 9 months ago
A Genetic Algorithm for Channel Routing using Inter-Cluster Mutation
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
B. B. Prahlada Rao, Lalit M. Patnaik, R. C. Hansda...
EVOW
2010
Springer
13 years 11 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
VLDB
1994
ACM
140views Database» more  VLDB 1994»
13 years 11 months ago
Efficient and Effective Clustering Methods for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
Raymond T. Ng, Jiawei Han