Efficient algorithms based on relational queries to mine frequent graphs

Walter Garcia; Carlos Ordonez; Kai Zhao; Ping Chen

doi:10.1145/1871902.1871906

Efficient algorithms based on relational queries to mine frequent graphs

Walter Garcia
, Carlos Ordonez
, Kai Zhao
, Ping Chen

Engineering

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

Original language	English
Title of host publication	Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10
Pages	17-23
Number of pages	7
DOIs	https://doi.org/10.1145/1871902.1871906
State	Published - 2010
Event	3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10 - Toronto, ON, Canada Duration: Oct 26 2010 → Oct 30 2010

Publication series

Name	International Conference on Information and Knowledge Management, Proceedings

Conference

Conference	3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10
Country/Territory	Canada
City	Toronto, ON
Period	10/26/10 → 10/30/10

ASJC Scopus Subject Areas

General Business,Management and Accounting
General Decision Sciences

Keywords

DBMS
Graph mining
SQL

Access to Document

10.1145/1871902.1871906

Cite this

Garcia, W., Ordonez, C., Zhao, K., & Chen, P. (2010). Efficient algorithms based on relational queries to mine frequent graphs. In Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10 (pp. 17-23). (International Conference on Information and Knowledge Management, Proceedings). https://doi.org/10.1145/1871902.1871906

Efficient algorithms based on relational queries to mine frequent graphs. / Garcia, Walter; Ordonez, Carlos; Zhao, Kai et al.
Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10. 2010. p. 17-23 (International Conference on Information and Knowledge Management, Proceedings).

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

Garcia, W, Ordonez, C, Zhao, K & Chen, P 2010, Efficient algorithms based on relational queries to mine frequent graphs. in Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10. International Conference on Information and Knowledge Management, Proceedings, pp. 17-23, 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10, Toronto, ON, Canada, 10/26/10. https://doi.org/10.1145/1871902.1871906

Garcia W, Ordonez C, Zhao K, Chen P. Efficient algorithms based on relational queries to mine frequent graphs. In Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10. 2010. p. 17-23. (International Conference on Information and Knowledge Management, Proceedings). doi: 10.1145/1871902.1871906

Garcia, Walter ; Ordonez, Carlos ; Zhao, Kai et al. / Efficient algorithms based on relational queries to mine frequent graphs. Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10. 2010. pp. 17-23 (International Conference on Information and Knowledge Management, Proceedings).

@inproceedings{7545b1da61914fd3becf458dedfe16d8,

title = "Efficient algorithms based on relational queries to mine frequent graphs",

keywords = "DBMS, Graph mining, SQL",

author = "Walter Garcia and Carlos Ordonez and Kai Zhao and Ping Chen",

year = "2010",

doi = "10.1145/1871902.1871906",

language = "English",

isbn = "9781450303859",

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

pages = "17--23",

booktitle = "Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10",

note = "3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10 ; Conference date: 26-10-2010 Through 30-10-2010",

}

TY - GEN

T1 - Efficient algorithms based on relational queries to mine frequent graphs

AU - Garcia, Walter

AU - Ordonez, Carlos

AU - Zhao, Kai

AU - Chen, Ping

PY - 2010

Y1 - 2010

KW - DBMS

KW - Graph mining

KW - SQL

UR - https://www.scopus.com/pages/publications/78651304678

UR - https://www.scopus.com/pages/publications/78651304678#tab=citedBy

U2 - 10.1145/1871902.1871906

DO - 10.1145/1871902.1871906

M3 - Conference contribution

AN - SCOPUS:78651304678

SN - 9781450303859

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 17

EP - 23

BT - Proceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10

T2 - 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10

Y2 - 26 October 2010 through 30 October 2010

ER -

Efficient algorithms based on relational queries to mine frequent graphs

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this