In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
Today, clusters are very important computing resources and many computing centers manage their clusters in private networks. But parallel programs may not work in private clusters....
Insoon Jo, Hyuck Han, Heon Young Yeom, Ohkyoung Kw...
As information networks become ubiquitous, extracting knowledge from information networks has become an important task. Both ranking and clustering can provide overall views on in...