skip to main content
10.1145/2063576.2063715acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Coupled nominal similarity in unsupervised learning

Published: 24 October 2011 Publication History

Abstract

The similarity between nominal objects is not straightforward, especially in unsupervised learning. This paper proposes coupled similarity metrics for nominal objects, which consider not only intra-coupled similarity within an attribute (i.e., value frequency distribution) but also inter-coupled similarity between attributes (i.e. feature dependency aggregation). Four metrics are designed to calculate the inter-coupled similarity between two categorical values by considering their relationships with other attributes. The theoretical analysis reveals their equivalent accuracy and superior efficiency based on intersection against others, in particular for large-scale data. Substantial experiments on extensive UCI data sets verify the theoretical conclusions. In addition, experiments of clustering based on the derived dissimilarity metrics show a significant performance improvement.

References

[1]
A. Ahmad and L. Dey. A k-mean clustering algorithm for mixed numeric and categorical data. Data and Knowledge Engineering, 63:503--527, 2007.
[2]
S. Boriah, V. Chandola, and V. Kumar. Similarity measures for categorical data: a comparative evaluation. In SDM 2008, pages 243--254, 2008.
[3]
D. Cai, X. He, and J. Han. Document clustering using locality preserving indexing. IEEE TKDE, 17(12):1624--1637, 2005.
[4]
L. Cao, Y. Ou, and P. Yu. Coupled behavior analysis with applications. IEEE Transactions on Knowledge and Data Engineering, 2011.
[5]
S. Cost and S. Salzberg. A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning, 10(1):57--78, 1993.
[6]
G. Das and H. Mannila. Context-based similarity measures for categorical databases. In PKDD 2000, pages 201--210, 2000.
[7]
G. Gan, C. Ma, and J. Wu. Data clustering: theory, algorithms, and applications. ASA-SIAM Series on Statistics and Applied Probability, VA, 2007.
[8]
M. Houle, V. Oria, and U. Qasim. Active caching for similarity queries based on shared-neighbor information. In CIKM 2010, pages 669--678, 2010.
[9]
U. Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):1--32, 2007.
[10]
D. Wilson and T. Martinez. Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6:1--34, 1997.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management
October 2011
2712 pages
ISBN:9781450307178
DOI:10.1145/2063576
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. accuracy
  2. complexity
  3. similarity measure

Qualifiers

  • Research-article

Conference

CIKM '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)16
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media