WS-GraphMatching: A web service tool for graph matching

Qiong Cheng, Mitsunori Ogihara, Jinpeng Wei, Alexander Zelikovsky

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1949-1950
Number of pages2
DOIs
StatePublished - 2010
Event19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 - Toronto, ON, Canada
Duration: Oct 26 2010Oct 30 2010

Other

Other19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
CountryCanada
CityToronto, ON
Period10/26/1010/30/10

Fingerprint

Web services
Graph
Query
Contraction
Batch
Service-oriented

Keywords

  • Graph matching
  • Graph mining

ASJC Scopus subject areas

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

Cite this

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

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

International Conference on Information and Knowledge Management, Proceedings. 2010. p. 1949-1950.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cheng, Q, Ogihara, M, Wei, J & Zelikovsky, A 2010, WS-GraphMatching: A web service tool for graph matching. in 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
Cheng Q, Ogihara M, Wei J, Zelikovsky A. WS-GraphMatching: A web service tool for graph matching. In International Conference on Information and Knowledge Management, Proceedings. 2010. p. 1949-1950 https://doi.org/10.1145/1871437.1871779
Cheng, Qiong ; Ogihara, Mitsunori ; Wei, Jinpeng ; Zelikovsky, Alexander. / WS-GraphMatching : A web service tool for graph matching. International Conference on Information and Knowledge Management, Proceedings. 2010. pp. 1949-1950
@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",
doi = "10.1145/1871437.1871779",
language = "English (US)",
isbn = "9781450300995",
pages = "1949--1950",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - WS-GraphMatching

T2 - A web service tool for graph matching

AU - Cheng, Qiong

AU - Ogihara, Mitsunori

AU - Wei, Jinpeng

AU - Zelikovsky, Alexander

PY - 2010

Y1 - 2010

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

SP - 1949

EP - 1950

BT - International Conference on Information and Knowledge Management, Proceedings

ER -