NDLI: Clustering without a metric

Content Provider	IEEE Xplore Digital Library
Author	Matthews, G. Hearne, J.
Copyright Year	1979
Abstract	A methodology for clustering data in which a distance metric or similarity function is not used is described. Instead, clusterings are optimized based on their intended function: the accurate prediction of properties of the data. The resulting clustering methodology is applicable, without further ad hoc assumptions or transformations of the data, (1) when features are heterogeneous (both discrete and continuous) and not combinable, (2) where some data points have missing feature values, and (3) where some features are irrelevant, i.e. have large variance but little correlation with other features. Further, it provides an integral measure of the quality of the resulting clustering. A clustering program, RIFFLE, has been implemented in line with this approach, and experiments with synthetic and real data show that the clustering is, in many respects, superior to traditional methods.<>
Sponsorship	IEEE Computer Society
Starting Page	175
Ending Page	184
Page Count	10
File Size	875295
File Format	PDF
ISSN	01628828
Volume Number	13
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1991-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data analysis Unsupervised learning Helium Cause effect analysis Pattern analysis Predictive models Computer errors Cities and towns Computer science Extraterrestrial measurements
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence Computational Theory and Mathematics Computer Vision and Pattern Recognition Software

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

A metric for line segments

An algebraic approach to automatic construction of structural models

Unsupervised learning of finite mixture models

Simultaneous feature selection and clustering using mixture models

Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Models

Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy

Time Series Analysis Using Geometric Template Matching

2-D shape classification using hidden Markov model

Unsupervised Learning of Categorical Segments in Image Collections

Clustering without a metric

Similar Documents

A metric for line segments

An algebraic approach to automatic construction of structural models

Unsupervised learning of finite mixture models

Simultaneous feature selection and clustering using mixture models

Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Models

Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy

Time Series Analysis Using Geometric Template Matching

2-D shape classification using hidden Markov model

Unsupervised Learning of Categorical Segments in Image Collections

Clustering without a metric