Name disambiguation can occur when one is seeking a list of publications of an author who has used different name variations and when there are multiple other authors with the same name. We present an efficient integrative machine learning framework for solving the name disambiguation problem: a blocking method retrieves candidate classes of authors with similar names and a clustering method, D...

Cluster analysis has been widely used in various disciplines such as pattern recognition, computer vision, and data mining. In this work we investigate the applicability of two spatial clustering algorithms, namely DBSCAN and STING, to a new problem domain: Color segmentation of skin lesion (tumor) images. Automated segmentation is a key step in the computerized analysis of skin lesion images s...

Density-based spatial clustering of applications with noise (DBSCAN) is a density-based clustering algorithm that has the characteristics of being able to discover clusters of any shape, effectively distinguishing noise points and naturally supporting spatial databases. DBSCAN has been widely used in the field of spatial data mining. This paper studies the parallelization design and realization...

Mobile telecommunication sector has been accelerated with GSM 1800 licenses in the Turkey. Since then, churn management has won vital importance for the GSM operators. Customers should have segmented according to their profitability for the churn management. If we know the profitable customer segments, we have chance to keep in hand the most important customers via the suitable promotions and c...

Many clustering algorithms suffer from scalability problems on massive datasets and do not support any user interaction during runtime. To tackle these problems, anytime clustering algorithms are proposed. They produce a fast approximate result which is continuously refined during the further run. Also, they can be stopped or suspended anytime and provide an answer. In this paper, we propose a ...

We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a skeletonstructured program that performs parallel exploration of each cluster. The approach is useful to improve performance on high-dimensional data, and is general w.r.t. the spatial index structure used. We report...

Corresponding Author: Muhammad Arif Saifudin Satellite Technology Center, Indonesian National Institute of Aeronautics and Space, Bogor, Indonesia Email: [email protected] Abstract: A new method to generate star catalog using density-based clustering is proposed. It identifies regions of a high star density by using Density-Based Spatial Clustering of Application with Noise (DBSCAN) alg...

In this paper we propose a new density based clustering algorithm via using the Mahalanobis metric. This is motivated by the current state-of-the-art density clustering algorithm DBSCAN and some fuzzy clustering algorithms. There are two novelties for the proposed algorithm: One is to adopt the Mahalanobis metric as distance measurement instead of the Euclidean distance in DBSCAN and the other ...

Malware Classification has been a challenging problem in the recent past and several researchers have attempted to solve this problem using various tools. It is security threat which can break machine operation while not knowing user’s data and it's tough to spot its behavior. This paper proposes a novel technique using DBSCAN (Density based Kmeans) algorithmic rule to spot the behavior of malw...

Tibetan text clustering has potential in Tibetan information processing domain. In this paper, clustering research across Chinese and Tibetan texts is proposed to benefit Chinese and Tibetan machine translation and sentence alignment. A Tibetan and Chinese keyword table is the main way to implement the text clustering across these two languages. Improved Kmeans and improved density-based spatia...