A method for solving a bipartite-graph clustering problem with sequence optimization

CIT 2007: 7th IEEE International Conference on Computer and Information Technology

Volumn , Issue , 2007, Pages 915-920

  Harada, Keiu ^a   Ishioka, Takuya ^a   Suzuki, Ikuo ^a   Furukawa, Masashi ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE-GRAPH CLUSTERING PROBLEM (BCP); OPTIMUM THRESHOLD OF COST;

INFORMATION RETRIEVAL; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM; WEB SERVICES;

GRAPH THEORY;

EID: 38049030605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2007.4385202     Document Type: Conference Paper

References (7)

1. Albert-Lázló Barabási, "Linked: The New Science of Networks", Perseus Books Group, 2002.
2. Kazunari Ishida, "Extracting Latent Web Communities", JSAI, SIG-SWO-A404-01, 2005.
3. Inderjit S. Dhillon, "Co-clustering documents and words using bipartite spectral graph partitioning. In Knowledge Discovery and Data Mining", pp. 269-274, 2001.
4. P. Erdös, A. Renyi, "On random, graphs", Publications Mathematicae, 6, pp. 290-297, 1959.
5. D. J. Watts, "Small Worlds: The Dynamics of Networks Between Order and Randomness", Princeton University Press, 1999.
6. Alexei Vacuteazquez, "Growing network, with local rules: Preferential attachment, clustering hierarchy, and degree correlations", Phys. Rev. E, Vol. 67, No. 5, p. 56104, 2003.
7. M. Furukawa, M. Watanabe, Y. Matsumura, "Local Clustering Organization for a New TSP Solution", JSME(C), Vol. 7.1, No. 7.1, p3189-3195, 2005