loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
7th IEEE International Conference on Computer and Information Technology (CIT 2007)
?A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization
Aizu-Wakamatsu City, Fukushima, Japan
October 16-October 19
ISBN: 0-7695-2983-6
ASCII Text
x 
 
Keiu Harada, Takuya Ishioka, Ikuo Suzuki, Masashi Furukawa, "?A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization," Computer and Information Technology, International Conference on, pp. 915-920, 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2007.194,
author = {Keiu Harada and Takuya Ishioka and Ikuo Suzuki and Masashi Furukawa},
title = {?A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization},
journal ={Computer and Information Technology, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2983-6},
pages = {915-920},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2007.194},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Technology, International Conference on
TI - ?A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization
SN - 0-7695-2983-6
SP915
EP920
A1 - Keiu Harada,
A1 - Takuya Ishioka,
A1 - Ikuo Suzuki,
A1 - Masashi Furukawa,
PY - 2007
VL - 0
JA - Computer and Information Technology, International Conference on
ER -
 
Keiu Harada, Hokkaido University
Takuya Ishioka, Hokkaido University
Ikuo Suzuki, Hokkaido University
Masashi Furukawa, Hokkaido University
In this paper, we propose the solving method of Bipartite-graph Clustering Problem (BCP) by transforming from BCP into Traveling Salesman Problem (TSP). The analysis of information in web is an important guide to understand how to organize the wisdom of mankind. Especially, to divide from related information into communities of a suitable number is useful to the extraction of valuable information. One of the methods for extracting the community is using bipartite graph. BCP is equal to TSP with some concentrated cities, in the point of classifying the similar vertexes into each cluster. In order to solve TSP by smaller computational cost, we adopt the Local Clustering Organization (LCO) method from many proposed solution for TSP. LCO has been proven to be possible to perform the high-speed computation for large-scale TSP. As the result of some computational experiments, we verified that our proposed method is possible to decide an optimum threshold of cost by observing the distribution.
Citation:
Keiu Harada, Takuya Ishioka, Ikuo Suzuki, Masashi Furukawa, "?A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization," cit, pp.915-920, 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.