Graph representations for web document clustering

Adam Schenker; Mark Last; Horst Bunke; Abraham Kandel

doi:10.1007/978-3-540-44871-6_108

Graph representations for web document clustering

Adam Schenker, Mark Last, Horst Bunke, Abraham Kandel

Department of Software and Information Systems Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

21 Scopus citations

Abstract

In this paper we describe clustering of web documents represented by graphs rather than vectors. We present a novel method for clustering graph-based data using the standard k-means algorithm and compare its performance to the conventional vector-model approach using cosine similarity. The proposed method is evaluated when using five different graph representations under two different clustering performance indices. The experiments are performed on two separate web document collections.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Francisco Jose Perales, Aurelio J. C. Campilho, Nicolas Perez Perez, Nicolas Perez Perez
Publisher	Springer Verlag
Pages	935-942
Number of pages	8
ISBN (Print)	3540402179, 9783540402176
DOIs	https://doi.org/10.1007/978-3-540-44871-6_108
State	Published - 1 Jan 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2652
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-44871-6_108

Cite this

Schenker, A., Last, M., Bunke, H., & Kandel, A. (2003). Graph representations for web document clustering. In F. J. Perales, A. J. C. Campilho, N. P. Perez, & N. P. Perez (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 935-942). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2652). Springer Verlag. https://doi.org/10.1007/978-3-540-44871-6_108

Schenker, Adam ; Last, Mark ; Bunke, Horst et al. / Graph representations for web document clustering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Francisco Jose Perales ; Aurelio J. C. Campilho ; Nicolas Perez Perez ; Nicolas Perez Perez. Springer Verlag, 2003. pp. 935-942 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{8051b61aaae5482794e26496c60aedc8,

title = "Graph representations for web document clustering",

abstract = "In this paper we describe clustering of web documents represented by graphs rather than vectors. We present a novel method for clustering graph-based data using the standard k-means algorithm and compare its performance to the conventional vector-model approach using cosine similarity. The proposed method is evaluated when using five different graph representations under two different clustering performance indices. The experiments are performed on two separate web document collections.",

author = "Adam Schenker and Mark Last and Horst Bunke and Abraham Kandel",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/978-3-540-44871-6_108",

language = "English",

isbn = "3540402179",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "935--942",

editor = "Perales, {Francisco Jose} and Campilho, {Aurelio J. C.} and Perez, {Nicolas Perez} and Perez, {Nicolas Perez}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Schenker, A, Last, M, Bunke, H & Kandel, A 2003, Graph representations for web document clustering. in FJ Perales, AJC Campilho, NP Perez & NP Perez (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2652, Springer Verlag, pp. 935-942. https://doi.org/10.1007/978-3-540-44871-6_108

Graph representations for web document clustering. / Schenker, Adam; Last, Mark; Bunke, Horst et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Francisco Jose Perales; Aurelio J. C. Campilho; Nicolas Perez Perez; Nicolas Perez Perez. Springer Verlag, 2003. p. 935-942 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2652).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Graph representations for web document clustering

AU - Schenker, Adam

AU - Last, Mark

AU - Bunke, Horst

AU - Kandel, Abraham

PY - 2003/1/1

Y1 - 2003/1/1

N2 - In this paper we describe clustering of web documents represented by graphs rather than vectors. We present a novel method for clustering graph-based data using the standard k-means algorithm and compare its performance to the conventional vector-model approach using cosine similarity. The proposed method is evaluated when using five different graph representations under two different clustering performance indices. The experiments are performed on two separate web document collections.

AB - In this paper we describe clustering of web documents represented by graphs rather than vectors. We present a novel method for clustering graph-based data using the standard k-means algorithm and compare its performance to the conventional vector-model approach using cosine similarity. The proposed method is evaluated when using five different graph representations under two different clustering performance indices. The experiments are performed on two separate web document collections.

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

U2 - 10.1007/978-3-540-44871-6_108

DO - 10.1007/978-3-540-44871-6_108

M3 - Chapter

AN - SCOPUS:23044443416

SN - 3540402179

SN - 9783540402176

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 935

EP - 942

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Perales, Francisco Jose

A2 - Campilho, Aurelio J. C.

A2 - Perez, Nicolas Perez

PB - Springer Verlag

ER -

Schenker A, Last M, Bunke H, Kandel A. Graph representations for web document clustering. In Perales FJ, Campilho AJC, Perez NP, Perez NP, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 935-942. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-44871-6_108

Graph representations for web document clustering

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this