Extraction of fuzzy clusters from weighted graphs

Seiji Hotta, Kohei Inoue, Kiichi Urahama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A spectral graph method is presented for partitioning of nodes in a graph into fuzzy clusters on the basis of weighted adjacency matrices. Extraction of a fuzzy cluster from a node set is formulated by an eigenvalue problem and clusters are extracted sequentially from major one to minor ones. A clustering scheme is devised at first for undirected graphs and it is next extended to directed graphs and also to undirected bipartite ones. These clustering methods are applied to analysis of a link structure in Web networks and image retrieval queried by keywords or sample images. Extracted structure of clusters is visualized by a multivariate exploration method called the correspondence analysis.

Original languageEnglish
Title of host publicationKnowledge Discovery and Data Mining
Subtitle of host publicationCurrent Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings
PublisherSpringer Verlag
Pages442-453
Number of pages12
ISBN (Print)3540673822, 9783540673828
Publication statusPublished - Jan 1 2000
Event4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000 - Kyoto, Japan
Duration: Apr 18 2000Apr 20 2000

Publication series

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

Other

Other4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000
CountryJapan
CityKyoto
Period4/18/004/20/00

Fingerprint

Directed graphs
Image retrieval
Weighted Graph
Correspondence Analysis
Image Retrieval
Adjacency Matrix
Graph in graph theory
Vertex of a graph
Clustering Methods
Undirected Graph
Directed Graph
Eigenvalue Problem
Minor
Partitioning
Clustering

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hotta, S., Inoue, K., & Urahama, K. (2000). Extraction of fuzzy clusters from weighted graphs. In Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings (pp. 442-453). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805). Springer Verlag.

Extraction of fuzzy clusters from weighted graphs. / Hotta, Seiji; Inoue, Kohei; Urahama, Kiichi.

Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Springer Verlag, 2000. p. 442-453 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hotta, S, Inoue, K & Urahama, K 2000, Extraction of fuzzy clusters from weighted graphs. in Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1805, Springer Verlag, pp. 442-453, 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000, Kyoto, Japan, 4/18/00.
Hotta S, Inoue K, Urahama K. Extraction of fuzzy clusters from weighted graphs. In Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Springer Verlag. 2000. p. 442-453. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hotta, Seiji ; Inoue, Kohei ; Urahama, Kiichi. / Extraction of fuzzy clusters from weighted graphs. Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Springer Verlag, 2000. pp. 442-453 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c7a08dae94b8460c9099552aa6389ee1,
title = "Extraction of fuzzy clusters from weighted graphs",
abstract = "A spectral graph method is presented for partitioning of nodes in a graph into fuzzy clusters on the basis of weighted adjacency matrices. Extraction of a fuzzy cluster from a node set is formulated by an eigenvalue problem and clusters are extracted sequentially from major one to minor ones. A clustering scheme is devised at first for undirected graphs and it is next extended to directed graphs and also to undirected bipartite ones. These clustering methods are applied to analysis of a link structure in Web networks and image retrieval queried by keywords or sample images. Extracted structure of clusters is visualized by a multivariate exploration method called the correspondence analysis.",
author = "Seiji Hotta and Kohei Inoue and Kiichi Urahama",
year = "2000",
month = "1",
day = "1",
language = "English",
isbn = "3540673822",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "442--453",
booktitle = "Knowledge Discovery and Data Mining",
address = "Germany",

}

TY - GEN

T1 - Extraction of fuzzy clusters from weighted graphs

AU - Hotta, Seiji

AU - Inoue, Kohei

AU - Urahama, Kiichi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - A spectral graph method is presented for partitioning of nodes in a graph into fuzzy clusters on the basis of weighted adjacency matrices. Extraction of a fuzzy cluster from a node set is formulated by an eigenvalue problem and clusters are extracted sequentially from major one to minor ones. A clustering scheme is devised at first for undirected graphs and it is next extended to directed graphs and also to undirected bipartite ones. These clustering methods are applied to analysis of a link structure in Web networks and image retrieval queried by keywords or sample images. Extracted structure of clusters is visualized by a multivariate exploration method called the correspondence analysis.

AB - A spectral graph method is presented for partitioning of nodes in a graph into fuzzy clusters on the basis of weighted adjacency matrices. Extraction of a fuzzy cluster from a node set is formulated by an eigenvalue problem and clusters are extracted sequentially from major one to minor ones. A clustering scheme is devised at first for undirected graphs and it is next extended to directed graphs and also to undirected bipartite ones. These clustering methods are applied to analysis of a link structure in Web networks and image retrieval queried by keywords or sample images. Extracted structure of clusters is visualized by a multivariate exploration method called the correspondence analysis.

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

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

M3 - Conference contribution

SN - 3540673822

SN - 9783540673828

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

SP - 442

EP - 453

BT - Knowledge Discovery and Data Mining

PB - Springer Verlag

ER -