• DocumentCode
    2527563
  • Title

    A New Approach to Graph Seriation

  • Author

    Jin, Tang ; Chunyan, Zhang ; Bin, Luo

  • Author_Institution
    Key Lab of Intelligent Comput. & Signal Process., Anhui Univ., Hefei
  • Volume
    3
  • fYear
    2006
  • fDate
    Aug. 30 2006-Sept. 1 2006
  • Firstpage
    625
  • Lastpage
    628
  • Abstract
    A novel graph seriation method based random graph theory is proposed in this paper. By seriation processing, graphs can be converted to string through constructing toroidal catch digraph. Seriated graph distance is using to represent the similarity between graphs. It measures the structural differences between graphs based on the dynamic warping technique. Dynamic time warping distance used in the paper is evaluated by dynamic programming. The results of our experiments demonstrate that the proposed method is eligible for graph distance measure
  • Keywords
    directed graphs; dynamic programming; pattern clustering; random processes; dynamic programming; dynamic time warping; graph clustering; graph seriation method; random graph theory; toroidal catch digraph; Data structures; Dynamic programming; Graph theory; Laplace equations; Machine vision; NP-hard problem; Pattern recognition; Probability distribution; Signal processing; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    0-7695-2616-0
  • Type

    conf

  • DOI
    10.1109/ICICIC.2006.385
  • Filename
    1692254