Independent informative subgraph mining for graph information retrieval

Bingjun Sun, Prasenjit Mitra, C. Lee Giles

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

5 Citations (Scopus)

Abstract

In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries significantly. For a given subgraph query, graph candidates that may contain the subgraph are retrieved using the graph index and subgraph isomorphism tests are performed to prune out unsatisfied graphs. However, since the space of all possible subgraphs of the whole set of graphs is prohibitively large, feature selection is required to identify a good subset of subgraph features for indexing. Thus, one of the key issues is: given the set of all possible subgraphs of the graph set, which subset of features is the optimal such that the algorithm retrieves the smallest set of candidate graphs and reduces the number of subgraph isomorphism tests? We introduce a graph search method for subgraph queries based on subgraph frequencies. Then, we propose several novel feature selection criteria, Max-Precision, Max-Irredundant-Information, and Max-Information-Min-Redundancy, based on mutual information. Finally we show theoretically and empirically that our proposed methods retrieve a smaller candidate set than previous methods. For example, using the same number of features, our method improve the precision for the query candidate set by 4%-13% in comparison to previous methods. As a result the response time of subgraph queries also is improved correspondingly.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages563-572
Number of pages10
DOIs
Publication statusPublished - 2009
Externally publishedYes
EventACM 18th International Conference on Information and Knowledge Management, CIKM 2009 - Hong Kong
Duration: 2 Nov 20096 Nov 2009

Other

OtherACM 18th International Conference on Information and Knowledge Management, CIKM 2009
CityHong Kong
Period2/11/096/11/09

Fingerprint

Graph
Information retrieval
Query
Isomorphism
Feature selection
Response time
Selection criteria
Indexing
Redundancy
Data base
Mutual information

Keywords

  • Feature selection
  • Graph mining
  • Graph search
  • Index pruning

ASJC Scopus subject areas

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

Cite this

Sun, B., Mitra, P., & Giles, C. L. (2009). Independent informative subgraph mining for graph information retrieval. In International Conference on Information and Knowledge Management, Proceedings (pp. 563-572) https://doi.org/10.1145/1645953.1646026

Independent informative subgraph mining for graph information retrieval. / Sun, Bingjun; Mitra, Prasenjit; Giles, C. Lee.

International Conference on Information and Knowledge Management, Proceedings. 2009. p. 563-572.

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

Sun, B, Mitra, P & Giles, CL 2009, Independent informative subgraph mining for graph information retrieval. in International Conference on Information and Knowledge Management, Proceedings. pp. 563-572, ACM 18th International Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, 2/11/09. https://doi.org/10.1145/1645953.1646026
Sun B, Mitra P, Giles CL. Independent informative subgraph mining for graph information retrieval. In International Conference on Information and Knowledge Management, Proceedings. 2009. p. 563-572 https://doi.org/10.1145/1645953.1646026
Sun, Bingjun ; Mitra, Prasenjit ; Giles, C. Lee. / Independent informative subgraph mining for graph information retrieval. International Conference on Information and Knowledge Management, Proceedings. 2009. pp. 563-572
@inproceedings{6f9b3bf7ab5f4cfca73909275b6f4a4e,
title = "Independent informative subgraph mining for graph information retrieval",
abstract = "In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries significantly. For a given subgraph query, graph candidates that may contain the subgraph are retrieved using the graph index and subgraph isomorphism tests are performed to prune out unsatisfied graphs. However, since the space of all possible subgraphs of the whole set of graphs is prohibitively large, feature selection is required to identify a good subset of subgraph features for indexing. Thus, one of the key issues is: given the set of all possible subgraphs of the graph set, which subset of features is the optimal such that the algorithm retrieves the smallest set of candidate graphs and reduces the number of subgraph isomorphism tests? We introduce a graph search method for subgraph queries based on subgraph frequencies. Then, we propose several novel feature selection criteria, Max-Precision, Max-Irredundant-Information, and Max-Information-Min-Redundancy, based on mutual information. Finally we show theoretically and empirically that our proposed methods retrieve a smaller candidate set than previous methods. For example, using the same number of features, our method improve the precision for the query candidate set by 4{\%}-13{\%} in comparison to previous methods. As a result the response time of subgraph queries also is improved correspondingly.",
keywords = "Feature selection, Graph mining, Graph search, Index pruning",
author = "Bingjun Sun and Prasenjit Mitra and Giles, {C. Lee}",
year = "2009",
doi = "10.1145/1645953.1646026",
language = "English",
isbn = "9781605585123",
pages = "563--572",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Independent informative subgraph mining for graph information retrieval

AU - Sun, Bingjun

AU - Mitra, Prasenjit

AU - Giles, C. Lee

PY - 2009

Y1 - 2009

N2 - In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries significantly. For a given subgraph query, graph candidates that may contain the subgraph are retrieved using the graph index and subgraph isomorphism tests are performed to prune out unsatisfied graphs. However, since the space of all possible subgraphs of the whole set of graphs is prohibitively large, feature selection is required to identify a good subset of subgraph features for indexing. Thus, one of the key issues is: given the set of all possible subgraphs of the graph set, which subset of features is the optimal such that the algorithm retrieves the smallest set of candidate graphs and reduces the number of subgraph isomorphism tests? We introduce a graph search method for subgraph queries based on subgraph frequencies. Then, we propose several novel feature selection criteria, Max-Precision, Max-Irredundant-Information, and Max-Information-Min-Redundancy, based on mutual information. Finally we show theoretically and empirically that our proposed methods retrieve a smaller candidate set than previous methods. For example, using the same number of features, our method improve the precision for the query candidate set by 4%-13% in comparison to previous methods. As a result the response time of subgraph queries also is improved correspondingly.

AB - In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries significantly. For a given subgraph query, graph candidates that may contain the subgraph are retrieved using the graph index and subgraph isomorphism tests are performed to prune out unsatisfied graphs. However, since the space of all possible subgraphs of the whole set of graphs is prohibitively large, feature selection is required to identify a good subset of subgraph features for indexing. Thus, one of the key issues is: given the set of all possible subgraphs of the graph set, which subset of features is the optimal such that the algorithm retrieves the smallest set of candidate graphs and reduces the number of subgraph isomorphism tests? We introduce a graph search method for subgraph queries based on subgraph frequencies. Then, we propose several novel feature selection criteria, Max-Precision, Max-Irredundant-Information, and Max-Information-Min-Redundancy, based on mutual information. Finally we show theoretically and empirically that our proposed methods retrieve a smaller candidate set than previous methods. For example, using the same number of features, our method improve the precision for the query candidate set by 4%-13% in comparison to previous methods. As a result the response time of subgraph queries also is improved correspondingly.

KW - Feature selection

KW - Graph mining

KW - Graph search

KW - Index pruning

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

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

U2 - 10.1145/1645953.1646026

DO - 10.1145/1645953.1646026

M3 - Conference contribution

AN - SCOPUS:74549174134

SN - 9781605585123

SP - 563

EP - 572

BT - International Conference on Information and Knowledge Management, Proceedings

ER -