Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
— This paper examines the potential of the Cell processor as a platform for secure data mining on the future volunteer computing systems. Volunteer computing platforms have the p...
Hong Wang 0006, Hiroyuki Takizawa, Hiroaki Kobayas...
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...