Visualization of data structures by fuzzy clustering of graphs

Seiji Hotta, Kiichi Urahama

Research output: Contribution to journalArticle

Abstract

A visualization method is presented for data represented by a graph partitioned into fuzzy clusters. The data are arranged in a two- or three-dimensional space by correspondence analysis based on the memberships of the data in the obtained clusters. Data related by their links are represented by a directed graph or a bipartite undirected one. The fuzzy clusters are then extracted sequentially from the data based on this graph representation. At each stage of cluster extraction, memberships are calculated by solving an optimization problem using an iterative scheme. The data are then arranged in a two- or a three-dimensional space by correspondence analysis based on the memberships of the data. This data visualization method can be used to recommend movies by visual collaborative filtering and to visualize structures in a software program. It can be extended to more complexly structured data represented by the combination of a directed graph and a bipartite undirected one. This extended method can be used to search for Web pages by keywords and to recommend them as links. For example, the Web can be browsed to find information about sofas and carpets based on the impression they make and to visualy support their coordination.

Original languageEnglish
Pages (from-to)1748-1755
Number of pages8
JournalKyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers
Volume54
Issue number12
DOIs
Publication statusPublished - Jan 1 2000

Fingerprint

Fuzzy clustering
Directed graphs
Data structures
Visualization
Collaborative filtering
Data visualization
Websites

All Science Journal Classification (ASJC) codes

  • Media Technology
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Visualization of data structures by fuzzy clustering of graphs. / Hotta, Seiji; Urahama, Kiichi.

In: Kyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers, Vol. 54, No. 12, 01.01.2000, p. 1748-1755.

Research output: Contribution to journalArticle

@article{5f7ede1946294dbbaf2f137e987e6523,
title = "Visualization of data structures by fuzzy clustering of graphs",
abstract = "A visualization method is presented for data represented by a graph partitioned into fuzzy clusters. The data are arranged in a two- or three-dimensional space by correspondence analysis based on the memberships of the data in the obtained clusters. Data related by their links are represented by a directed graph or a bipartite undirected one. The fuzzy clusters are then extracted sequentially from the data based on this graph representation. At each stage of cluster extraction, memberships are calculated by solving an optimization problem using an iterative scheme. The data are then arranged in a two- or a three-dimensional space by correspondence analysis based on the memberships of the data. This data visualization method can be used to recommend movies by visual collaborative filtering and to visualize structures in a software program. It can be extended to more complexly structured data represented by the combination of a directed graph and a bipartite undirected one. This extended method can be used to search for Web pages by keywords and to recommend them as links. For example, the Web can be browsed to find information about sofas and carpets based on the impression they make and to visualy support their coordination.",
author = "Seiji Hotta and Kiichi Urahama",
year = "2000",
month = "1",
day = "1",
doi = "10.3169/itej.54.1748",
language = "English",
volume = "54",
pages = "1748--1755",
journal = "Kyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers",
issn = "1342-6907",
publisher = "Institute of Image Information and Television Engineers",
number = "12",

}

TY - JOUR

T1 - Visualization of data structures by fuzzy clustering of graphs

AU - Hotta, Seiji

AU - Urahama, Kiichi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - A visualization method is presented for data represented by a graph partitioned into fuzzy clusters. The data are arranged in a two- or three-dimensional space by correspondence analysis based on the memberships of the data in the obtained clusters. Data related by their links are represented by a directed graph or a bipartite undirected one. The fuzzy clusters are then extracted sequentially from the data based on this graph representation. At each stage of cluster extraction, memberships are calculated by solving an optimization problem using an iterative scheme. The data are then arranged in a two- or a three-dimensional space by correspondence analysis based on the memberships of the data. This data visualization method can be used to recommend movies by visual collaborative filtering and to visualize structures in a software program. It can be extended to more complexly structured data represented by the combination of a directed graph and a bipartite undirected one. This extended method can be used to search for Web pages by keywords and to recommend them as links. For example, the Web can be browsed to find information about sofas and carpets based on the impression they make and to visualy support their coordination.

AB - A visualization method is presented for data represented by a graph partitioned into fuzzy clusters. The data are arranged in a two- or three-dimensional space by correspondence analysis based on the memberships of the data in the obtained clusters. Data related by their links are represented by a directed graph or a bipartite undirected one. The fuzzy clusters are then extracted sequentially from the data based on this graph representation. At each stage of cluster extraction, memberships are calculated by solving an optimization problem using an iterative scheme. The data are then arranged in a two- or a three-dimensional space by correspondence analysis based on the memberships of the data. This data visualization method can be used to recommend movies by visual collaborative filtering and to visualize structures in a software program. It can be extended to more complexly structured data represented by the combination of a directed graph and a bipartite undirected one. This extended method can be used to search for Web pages by keywords and to recommend them as links. For example, the Web can be browsed to find information about sofas and carpets based on the impression they make and to visualy support their coordination.

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

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

U2 - 10.3169/itej.54.1748

DO - 10.3169/itej.54.1748

M3 - Article

AN - SCOPUS:31244435385

VL - 54

SP - 1748

EP - 1755

JO - Kyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers

JF - Kyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers

SN - 1342-6907

IS - 12

ER -