NDLI: Pairwise Clustering by Minimizing the Error of Unsupervised Nearest Neighbor Classification

Content Provider	IEEE Xplore Digital Library
Author	Yingzhen Yang Xinqi Chu Huang, T.S.
Copyright Year	2013
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA (Yingzhen Yang; Xinqi Chu; Huang, T.S.)
Abstract	Pair wise clustering methods, including the popular graph cut based approaches such as normalized cut, partition the data space into clusters by the pair wise affinity between data points. The success of pair wise clustering largely depends on the pair wise affinity function defined over data points coming from different clusters. Interpreting the pair wise affinity in a probabilistic framework, we build the relationship between pair wise clustering and unsupervised classification by learning the soft Nearest Neighbor (NN) classifier from unlabeled data, and search for the optimal partition of the data points by minimizing the generalization error of the learned classifier associated with the data partitions. Modeling the underlying distribution of the data by non-parametric kernel density estimation, the asymptotic generalization error of the unsupervised soft NN classification involves only the pair wise affinity between data points. Moreover, such error rate reduces to the well-known kernel form of graph cut in case of uniform data distribution, which provides another understanding of the kernel similarity used in Laplacian Eigenmaps [1] which also assumes uniform distribution. By minimizing the generalization error bound, we propose a new clustering algorithm. Our algorithm efficiently partition the data by inference in a pair wise MRF model. Experimental results demonstrate the effectiveness of our method.
Sponsorship	IEEE Syst., Man, Cybern. Soc.
Starting Page	182
Ending Page	187
File Size	446053
Page Count	6
File Format	PDF
ISBN	9780769551449
DOI	10.1109/ICMLA.2013.188
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-04
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Training Pairwise Clustering Clustering methods Nearest Neighbor Classifier Clustering algorithms Kernel Density Estimation Bandwidth Data models Labeling Kernel
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimization of the smoothing parameter of variable kernel estimator

Robust Local Triangular Kernel density-based clustering for high-dimensional data

Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph

Nearest Neighbor Classification by Partially Fuzzy Clustering

K-Nearest Neighbor Clustering Algorithm Based on Kernel Methods

Fast Nearest Neighbor Classification using Class-Based Clustering

Novel Text Classification Based on K-Nearest Neighbor

Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering

Fusion of pairwise nearest-neighbor classifiers based on pairwise-weighted distance metric and Dempster-Shafer theory

Pairwise Clustering by Minimizing the Error of Unsupervised Nearest Neighbor Classification

Similar Documents

Optimization of the smoothing parameter of variable kernel estimator

Robust Local Triangular Kernel density-based clustering for high-dimensional data

Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph

Nearest Neighbor Classification by Partially Fuzzy Clustering

K-Nearest Neighbor Clustering Algorithm Based on Kernel Methods

Fast Nearest Neighbor Classification using Class-Based Clustering

Novel Text Classification Based on K-Nearest Neighbor

Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering

Fusion of pairwise nearest-neighbor classifiers based on pairwise-weighted distance metric and Dempster-Shafer theory

Pairwise Clustering by Minimizing the Error of Unsupervised Nearest Neighbor Classification