Improving classifications through graph embeddings

Anirban Chatterjee, Sanjukta Bhowmick, Padma Raghavan

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Unsupervised classification is used to identify similar entities in a dataset and is extensively used in many application domains such as spam filtering [5], medical diagnosis [15], demographic research [13], etc. Unsupervised classification using K-Means generally clusters data based on (1) distance-based attributes of the dataset [4, 16, 17, 23] or (2) combinatorial properties of a weighted graph representation of the dataset [8].

Original languageEnglish (US)
Title of host publicationGraph Embedding for Pattern Analysis
PublisherSpringer New York
Pages119-138
Number of pages20
ISBN (Electronic)9781461444572
ISBN (Print)9781461444565
DOIs
Publication statusPublished - Jan 1 2013

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chatterjee, A., Bhowmick, S., & Raghavan, P. (2013). Improving classifications through graph embeddings. In Graph Embedding for Pattern Analysis (pp. 119-138). Springer New York. https://doi.org/10.1007/978-1-4614-4457-2_5