An Enhanced Spectral Clustering for Overlapping Data in Multiple Task Clustering
نویسندگان
چکیده
Clustering is one of the most widely used approaches for exploratory data analysis in data mining. In large scale data sources, multitask clustering is an important research work to handle overlapping data, negative and non-negative values among clustering of multiple tasks which is used to improve the learning relationship among related tasks and sharing of information across the tasks. Recent past spectral clustering has become the well accepted clustering algorithm to perform multitask clustering which relies on the eigenstructure of a similarity matrix and outperforms partitioning of data with more complicated structures than traditional clustering algorithms such as the Kmeans and Fuzzy C-means. This research work proposes an enhanced multitask spectral clustering (EMTSC) technique to perform multitask clustering without overlapping in data points among clustering of multiple tasks in large data sets for improving clustering performance.
منابع مشابه
Analyse Power Consumption by Mobile Applications Using Fuzzy Clustering Approach
With the advancements in mobile technology and its utilization in every facet of life, mobile popularity has enhanced exponentially. The biggest constraint in the utility of mobile devices is that they are powered with batteries. Optimizing mobile’s size and weight is always the choice of designer, which led limited size and capacity of battery used in mobile phone. In this paper analysis of th...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملDealing with Overlapping Clustering: A Constraint-based Approach to Algorithm Selection
When confronted to a clustering problem, one has to choose which algorithm to run. Building a system that automatically chooses an algorithm for a given task is the algorithm selection problem. Unlike the well-studied task of classification, clustering algorithm selection cannot rely on labels to choose which algorithm to use. However, in the context of constraint-based clustering, we argue tha...
متن کاملAn Empirical Comparison of Distance Measures for Multivariate Time Series Clustering
Multivariate time series (MTS) data are ubiquitous in science and daily life, and how to measure their similarity is a core part of MTS analyzing process. Many of the research efforts in this context have focused on proposing novel similarity measures for the underlying data. However, with the countless techniques to estimate similarity between MTS, this field suffers from a lack of comparative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016