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
StatePublished - 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

Improving classifications through graph embeddings. / Chatterjee, Anirban; Bhowmick, Sanjukta; Raghavan, Padma.

Graph Embedding for Pattern Analysis. Springer New York, 2013. p. 119-138.

Research output: Chapter in Book/Report/Conference proceedingChapter

Chatterjee, A, Bhowmick, S & Raghavan, P 2013, Improving classifications through graph embeddings. in Graph Embedding for Pattern Analysis. Springer New York, pp. 119-138. https://doi.org/10.1007/978-1-4614-4457-2_5
Chatterjee A, Bhowmick S, Raghavan P. Improving classifications through graph embeddings. In Graph Embedding for Pattern Analysis. Springer New York. 2013. p. 119-138 https://doi.org/10.1007/978-1-4614-4457-2_5
Chatterjee, Anirban ; Bhowmick, Sanjukta ; Raghavan, Padma. / Improving classifications through graph embeddings. Graph Embedding for Pattern Analysis. Springer New York, 2013. pp. 119-138
@inbook{26bcb3dc41284ae0a89c40f008f675a8,
title = "Improving classifications through graph embeddings",
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].",
author = "Anirban Chatterjee and Sanjukta Bhowmick and Padma Raghavan",
year = "2013",
month = "1",
day = "1",
doi = "10.1007/978-1-4614-4457-2_5",
language = "English (US)",
isbn = "9781461444565",
pages = "119--138",
booktitle = "Graph Embedding for Pattern Analysis",
publisher = "Springer New York",

}

TY - CHAP

T1 - Improving classifications through graph embeddings

AU - Chatterjee, Anirban

AU - Bhowmick, Sanjukta

AU - Raghavan, Padma

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=84948987483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948987483&partnerID=8YFLogxK

U2 - 10.1007/978-1-4614-4457-2_5

DO - 10.1007/978-1-4614-4457-2_5

M3 - Chapter

AN - SCOPUS:84948987483

SN - 9781461444565

SP - 119

EP - 138

BT - Graph Embedding for Pattern Analysis

PB - Springer New York

ER -