WS-GraphMatching: A web service tool for graph matching

Qiong Cheng; Mitsunori Ogihara; Jinpeng Wei; Alexander Zelikovsky

doi:10.1145/1871437.1871779

WS-GraphMatching: A web service tool for graph matching

Qiong Cheng, Mitsunori Ogihara, Jinpeng Wei, Alexander Zelikovsky

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Some emerging applications deal with graph data and relie on graph matching and mining. The service-oriented graph matching and mining tool has been required. In this demo we present the web service tool WS-GraphMatching which supports the efficient and visualized matching of polytrees, series-parallel graphs, and arbitrary graphs with bounded feedback vertex set. Its embedded matching algorithms take in account the similarity of vertex-to-vertex and graph structures, allowing path contraction, vertex deletion, and vertex insertions. It provides one-to-one matching queries as well as queries in batch modes including one-to-many matching mode and many-to-many matching mode. It can be used for predicting unknown structured information, comparing and finding conserved patterns, and resolving ambiguous identification of vertices.

Original language	English (US)
Title of host publication	CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops
Pages	1949-1950
Number of pages	2
DOIs	https://doi.org/10.1145/1871437.1871779
State	Published - Dec 1 2010
Event	19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 - Toronto, ON, Canada Duration: Oct 26 2010 → Oct 30 2010

Publication series

Name	International Conference on Information and Knowledge Management, Proceedings

Other

Other	19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
Country	Canada
City	Toronto, ON
Period	10/26/10 → 10/30/10

Keywords

Graph matching
Graph mining

ASJC Scopus subject areas

Decision Sciences(all)
Business, Management and Accounting(all)

Access to Document

10.1145/1871437.1871779

Fingerprint Dive into the research topics of 'WS-GraphMatching: A web service tool for graph matching'. Together they form a unique fingerprint.

Cite this

Cheng, Q., Ogihara, M., Wei, J., & Zelikovsky, A. (2010). WS-GraphMatching: A web service tool for graph matching. In CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops (pp. 1949-1950). (International Conference on Information and Knowledge Management, Proceedings). https://doi.org/10.1145/1871437.1871779

WS-GraphMatching : A web service tool for graph matching. / Cheng, Qiong; Ogihara, Mitsunori; Wei, Jinpeng; Zelikovsky, Alexander.

CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. 2010. p. 1949-1950 (International Conference on Information and Knowledge Management, Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cheng, Q, Ogihara, M, Wei, J & Zelikovsky, A 2010, WS-GraphMatching: A web service tool for graph matching. in CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops. International Conference on Information and Knowledge Management, Proceedings, pp. 1949-1950, 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10, Toronto, ON, Canada, 10/26/10. https://doi.org/10.1145/1871437.1871779

@inproceedings{61e881e2ed374e96a6934ee6b37a1b02,

title = "WS-GraphMatching: A web service tool for graph matching",

abstract = "Some emerging applications deal with graph data and relie on graph matching and mining. The service-oriented graph matching and mining tool has been required. In this demo we present the web service tool WS-GraphMatching which supports the efficient and visualized matching of polytrees, series-parallel graphs, and arbitrary graphs with bounded feedback vertex set. Its embedded matching algorithms take in account the similarity of vertex-to-vertex and graph structures, allowing path contraction, vertex deletion, and vertex insertions. It provides one-to-one matching queries as well as queries in batch modes including one-to-many matching mode and many-to-many matching mode. It can be used for predicting unknown structured information, comparing and finding conserved patterns, and resolving ambiguous identification of vertices.",

keywords = "Graph matching, Graph mining",

author = "Qiong Cheng and Mitsunori Ogihara and Jinpeng Wei and Alexander Zelikovsky",

year = "2010",

month = dec,

day = "1",

doi = "10.1145/1871437.1871779",

language = "English (US)",

isbn = "9781450300995",

series = "International Conference on Information and Knowledge Management, Proceedings",

pages = "1949--1950",

booktitle = "CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops",

note = "19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 ; Conference date: 26-10-2010 Through 30-10-2010",

}

TY - GEN

T1 - WS-GraphMatching

T2 - 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10

AU - Cheng, Qiong

AU - Ogihara, Mitsunori

AU - Wei, Jinpeng

AU - Zelikovsky, Alexander

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Some emerging applications deal with graph data and relie on graph matching and mining. The service-oriented graph matching and mining tool has been required. In this demo we present the web service tool WS-GraphMatching which supports the efficient and visualized matching of polytrees, series-parallel graphs, and arbitrary graphs with bounded feedback vertex set. Its embedded matching algorithms take in account the similarity of vertex-to-vertex and graph structures, allowing path contraction, vertex deletion, and vertex insertions. It provides one-to-one matching queries as well as queries in batch modes including one-to-many matching mode and many-to-many matching mode. It can be used for predicting unknown structured information, comparing and finding conserved patterns, and resolving ambiguous identification of vertices.

AB - Some emerging applications deal with graph data and relie on graph matching and mining. The service-oriented graph matching and mining tool has been required. In this demo we present the web service tool WS-GraphMatching which supports the efficient and visualized matching of polytrees, series-parallel graphs, and arbitrary graphs with bounded feedback vertex set. Its embedded matching algorithms take in account the similarity of vertex-to-vertex and graph structures, allowing path contraction, vertex deletion, and vertex insertions. It provides one-to-one matching queries as well as queries in batch modes including one-to-many matching mode and many-to-many matching mode. It can be used for predicting unknown structured information, comparing and finding conserved patterns, and resolving ambiguous identification of vertices.

KW - Graph matching

KW - Graph mining

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

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

U2 - 10.1145/1871437.1871779

DO - 10.1145/1871437.1871779

M3 - Conference contribution

AN - SCOPUS:78651286155

SN - 9781450300995

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 1949

EP - 1950

BT - CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops

Y2 - 26 October 2010 through 30 October 2010

ER -