A dimension reduction algorithm preserving both global and local clustering structure
نویسندگان
چکیده
منابع مشابه
DLPR: A Distributed Locality Preserving Dimension Reduction Algorithm
Document indexing using dimension reduction has been widely studied in recent years. Application of these methods in large distributed systems may be inefficient due to the required computational, storage, and communication costs. In this paper, we propose DLPR, a distributed locality preserving dimension reduction algorithm, to project a large distributed data set into a lower dimensional spac...
متن کاملDimension Reduction for Clustering Time Series Using Global Characteristics
Existing methods for time series clustering rely on the actual data values can become impractical since the methods do not easily handle dataset with high dimensionality, missing value, or different lengths. In this paper, a dimension reduction method is proposed that replaces the raw data with some global measures of time series characteristics. These measures are then clustered using a self-o...
متن کاملDimension Theory Local and Global
These survey lectures are devoted to a new subject of the large scale dimension theory which was initiated by Gromov as a part of asymptotic geometry. We are going to enter the large scale world and consider some new concepts, results and examples which are parallel in many cases to the corresponding elements of the standard (local) dimension theory. We start our presentation with the motivations.
متن کاملDegenerate Expectation-Maximization Algorithm for Local Dimension Reduction
Dimension reduction techniques based on principal component analysis (PCA) and factor analysis are commonly used in statistical data analysis. The effectiveness of these methods is limited by their global nature. Recent efforts have focused on relaxing global restrictions in order to identify subsets of data that are concentrated on lower dimensional subspaces. In this paper, we propose an adap...
متن کاملClique-graph matching by preserving global & local structure
This paper originally proposes the clique-graph and further presents a clique-graph matching method by preserving global and local structures. Especially, we formulate the objective function of clique-graph matching with respective to two latent variables, the clique information in the original graph and the pairwise clique correspondence constrained by the one-to-one matching. Since the object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2017
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2016.11.020