5603 search results - page 330 / 1121 » Feature Selection for Clustering |
202
click to vote
UAI
2008
15 years 8 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
156
click to vote
IJCAI
2007
15 years 8 months ago
2007
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
174
click to vote
ISSTA
2006
ACM
16 years 21 days ago
2006
ACM
As the Aspect-Oriented Software Development gains popularity, there is growing interest as developing for existing object-oriented software aspects to address the crosscutting pro...
163
click to vote
ITNG
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, the bottleneck problem in PRMC-based wireless sensor networks is studied. This problem can be solved by overlapping neighboring layers. By this way, more cluster he...
184
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we propose a new version of the topological maps algorithm, which has been used to cluster web site visitors. These are characterized by partially redundant variabl...