scispace - formally typeset
Proceedings ArticleDOI

Evolutionary Distance Metric Learning Approach to Semi-supervised Clustering with Neighbor Relations

Reads0
Chats0
TLDR
This study proposes a distance metric learning method based on a clustering index with neighbor relation that simultaneously evaluates inter-and intra-clusters and optimizes a distance transform matrix based on the Mahalanobis distance by utilizing a self-adaptive differential evolution algorithm.
Abstract
This study proposes a distance metric learning method based on a clustering index with neighbor relation that simultaneously evaluates inter-and intra-clusters. Our proposed method optimizes a distance transform matrix based on the Mahalanobis distance by utilizing a self-adaptive differential evolution (jDE) algorithm. Our approach directly improves various clustering indices and in principle requires less auxiliary information compared to conventional metric learning methods. We experimentally validated the search efficiency of jDE and the generalization performance.

read more

Citations
More filters
Proceedings ArticleDOI

Fuzzy Clustering Algorithms — Review of the Applications

Jiamin Li, +1 more
TL;DR: A wide-range of research is surveyed that has well-designed mathematic models for fuzzy clustering, some of which include genetic algorithms and neural networks, and displays sample results from hands-on practice with these packages.
Journal ArticleDOI

Safety-aware Graph-based Semi-Supervised Learning

TL;DR: This paper introduces a Safety-aware GSSL (SaGSSL) method which can adaptively select the good graphs and learn a safe semi-supervised classifier simultaneously and Experimental results on several datasets show that the algorithm can simultaneously implement the graph selection and safely exploit the unlabeled samples.
Proceedings Article

Kernelized Evolutionary Distance Metric Learning for Semi-Supervised Clustering.

TL;DR: This work aims to provide a history of information science and technology in Japan from the perspective of the 1980s to the present, with a focus on the development of Information Science and Technology.
Journal ArticleDOI

RGloVe: An Improved Approach of Global Vectors for Distributional Entity Relation Representation

TL;DR: This paper focuses on a new finding of unsupervised relation extraction; which is called distributional relation representation, which aims to automatically learn entity vectors and further estimate semantic similarity between these entities.
Proceedings ArticleDOI

Evolutionary multi-objective distance metric learning for multi-label clustering

TL;DR: Experimental results have shown that the proposed DML method produces better transform matrices than single-objective optimization and is helpful in finding the attributes that affect the trade-off relationship among objective functions.
References
More filters
Journal ArticleDOI

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Journal ArticleDOI

Nonlinear dimensionality reduction by locally linear embedding.

TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Journal ArticleDOI

A global geometric framework for nonlinear dimensionality reduction.

TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Proceedings Article

Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering

TL;DR: The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality preserving properties and a natural connection to clustering.
Proceedings Article

Distance Metric Learning for Large Margin Nearest Neighbor Classification

TL;DR: In this article, a Mahanalobis distance metric for k-NN classification is trained with the goal that the k-nearest neighbors always belong to the same class while examples from different classes are separated by a large margin.
Related Papers (5)