Relational graph analysis with real-world constraints: An application in IRS tax fraud detection

AAAI Workshop - Technical Report

Volumn WS-05-07, Issue , 2005, Pages 30-38

  Bloedorn, Eric ^a   Rothleder, Neal J ^a   DeBarr, David ^a   Rosen, Lowell ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL CONSTRAINTS; GRAPH MINING; OPTIMIZATION INFORMATION; TAX FRAUD DETECTION;

CONSTRAINT THEORY; DATABASE SYSTEMS; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES; REAL TIME SYSTEMS; SOFTWARE PROTOTYPING;

GRAPH THEORY;

EID: 33646034344     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Berry, P., Harrison, I., Lowrance, J., Rodrigues, A., Ruspini, E., Thomere, J., and Wolverton, M., "Link Analysis Workbench, SRI International". Technical Report: AFRL-IF-RS-TR-2004-247, Air Force Research Laboratory, September, 2004.
2. Blau, H., Immerman, N. and Jensen, D. A visual language for querying and updating graphs. University of Massachusetts Amherst Computer Science Technical Report 2002-037. 2002.
3. Burman, L., "Statement of Leonard E. Burman before the United States House of Representatives Committee on the Budget; On Waste, Fraud, and Abuse In Federal Mandatory Programs", July 9, 2003. http://www.taxpolicycenter.org/publications/template.cfm?PubID=900641
4. Comai S., Damiani, E., Fraternali, P., Paraboschi, , S., Tanca, L., "XML-GL: a Graphical Language for Querying and Restructuring XML Documents", Computer Networks, Vol. 31 (1999).
5. Dzeroski, S., "Multi-Relational Data Mining: An Introduction", SIGKDD Explorations Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, Vol 5, Issue 1, July 2003
6. Garey, M. and Johnson, D. Computers and Intractability: A guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
7. Hall, M. W. and Kennedy, K. Efficient call graph analysis. Letters on Programming Languages and Systems 1, 3. http://citeseer.ist.psu.edu/hall92efficient.html, 1992.
8. Kuramochi, M., and Karypis, G., "Finding Frequent Patterns in a Large Sparse Graph", Proceedings of the Fourth SIAM Data Mining Conference, 2004
9. McKay, B. Nauty User's Guide (version 2.2), http://cs.anu.edu.au/people/bdm/nauty/nug.pdf. Computer Science Department, Australian National University, ACT 0200, Australia, 2005
10. Tutte, W.T. Graph theory. Encyclopedia of Mathematics and its Applications v 21, Addison-Wesley Publishing Co., Reading, Mass., 1984.
11. Valiente, G. Algorithms on Trees and Graphs, Spring-Verlag, 1988.
12. Washio, T and Motoda, H. State of the Art in Graph-based Data Mining. SIGKDD Explorations Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, Vol 5, Issue 1, July 2003
13. Wasserman, Stanley and Katherine Faust. Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press. 1994