Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
Reputation systems facilitate cooperation in open environments. Centrality-based reputation systems use centrality measures to rank individuals, i.e., compute their reputation bas...
It has been shown that self-organized maps, when adequately trained with the set of integers 1 to 32, lay out real numbers in a 2D map in an ordering that is superior to any of the...
This paper uses an optimization approach to address the problem of conceptual clustering. The aim of AGAPE, which is based on the tabu-search meta-heuristic using split, merge and ...