Semantically ranked graph pattern queries for link analysis

ISI 2007: 2007 IEEE Intelligence and Security Informatics

Volumn , Issue , 2007, Pages 296-299

  Seid, Dawit ^a   Mehrotra, Sharad ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; GRAPH THEORY; INTELLIGENT AGENTS; PATTERN RECOGNITION; SEMANTIC WEB; TELECOMMUNICATION LINKS;

GRAPH PATTERN QUERIES; INTELLIGENCE LINK ANALYSIS; PROTOTYPICAL GRAPH PATTERNS; SEMANTIC SIMILARITIES;

QUEUEING NETWORKS;

EID: 34748913654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isi.2007.379488     Document Type: Conference Paper

References (12)

1. R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Co., Inc., Boston, MA, USA, 1999.
2. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun.of the ACM, 16(9):575-577, 1973.
3. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett., 18(9):689-694, 1997.
4. H. Bunke, X. Jiang, and A. Kandel. On the minimum common supergraph of two graphs. Computing, 65(1): 13-25, 2000.
5. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett., 19(3-4):255-259, 1998.
6. T. Coffman, S. Greenblatt, and S. Marcus. Graph-based technologies for intelligence analysis. Commun. of the ACM, 47(3):45-47, 2004.
7. R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83-99, 1999.
8. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2): 100-107, 1968.
9. L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell., PAMI-3:504-519, 1981.
10. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS '02, pages 39-52, 2002.
11. W. D. Wallis, P. Shoubridge, M. Kraetz, and D. Ray. Graph distances using graph union. Pattern Recogn. Lett., 22(6-7):701-704, 2001.
12. M. Wolverton and et al. Law: A workbench for approximate pattern matching in relational data. In Proceedings of the Fifteenth Innovative Applications of Artificial Intelligence Conference (IAAI-03), pages 143-150, 2003.