In this paper, we present a new speaker diarization system that improves the accuracy of traditional hierarchical clustering-based methods with little increase in computational co...
Huazhong Ning, Wei Xu, Yihong Gong, Thomas S. Huan...
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...
Zhong Yi Sun, Matthieu Perrot, Alan Tucholka, Deni...