On signatures for communication graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 189-198

  Cormode, Graham ^a   Korn, Flip ^a   Muthukrishnan, S ^b   Wu, Yihua ^b  

^a AT AND T LABS RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; ELECTRONIC COMMERCE; GRAPH THEORY; INTERNET; INTERNET PROTOCOLS; KNOWLEDGE BASED SYSTEMS; TECHNOLOGY; TELEPHONE;

CASE STUDIES; COMMUNICATION GRAPHS; COMMUNICATION NETWORKS; CONCRETE APPLICATIONS; DATA ENGINEERING; E-BUSINESS; ENTERPRISE NETWORKS; FORMAL FRAMEWORK; FRAUDSTERS; FUNDAMENTAL PROPERTIES; INSTANT MESSAGES; INTERNATIONAL CONFERENCES; IP ADDRESSES; REAL DATA; SIGNATURE SCHEMES; SYSTEMATIC STUDY; TELEPHONE CALLS; WEB FORUMS;

APPLICATIONS;

EID: 52649109095     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497427     Document Type: Conference Paper

References (27)

1. J. Baumes, M. Goldberg, M. Hayvanovych. M. Magdon-Ismail, W. Wallace, and M. J. Zaki. Finding hidden group structure in a stream of communications. In ISI. 2006.
2. P. Berkhin. A survey on pagerank computing. Internet Mathematics, 2(1):73-120, 2005.
3. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. In LATIN, 2004.
4. C. Cortes and D. Pregibon. Signature-based methods for data streams. Data Min. Knowl. Discov., 5(3): 167-182, 2001.
5. C. Cortes, D. Pregibon, and C. Volinsky. Communities of interest. Lecture Notes in Computer Science. 2189, 2001.
6. T. Fawcett and F. Provost. Activity monitoring: Noticing interesting changes in behavior. In SIGKDD, 1999.
7. P. Flajolet and G.N. Martin. Probabilistic counting. In FOCS, 1983.
8. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.
9. T. H. Haveliwala. Topic-sensitive pagerank. In WWW, 2002.
10. S. Hill, D. Agarwal, R. Bell, and C. Volinsky. Building an effective representation for dynamic network. Computational and Graphical Statistics. 15(3):584-608(25), 2006.
11. S. Hill and F. Provost. The myth of the double-blind review? Author identification using only citations. SIGKDD Explorations. 5(2):179-184, 2003.
12. S. Hill, F. Provost, and C. Volinsky. Network-based marketing: Identifying likely adopters via consumer networks. Statistical Science. 21(2):256-276, 2006.
13. A. Hussain, J. Heidemann, and C. Papadopoulos. Identification of repeated DOS attacks. In INFOCOM, 2006.
14. P. Indyk, and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
15. A. Jain, R. Duin, and J. Mao. Statistical pattern recognition: A review. IEEE Transaction on Pattern Analysis and Machine Intelligence. 22(1):4-37, 2000.
16. A. Lakhina, M. Crovella, and C. Diot. Diagnosing network-wide traffic anomalies. In SIGCOMM, 2004.
17. S. Mason and N. Graham. Areas beneath the relative operating characteristics (ROC) and relative operating levels (ROL) curves: Statistical significance and interpretation. Q. J. R. Meteorol. Soc. 30:291-303, 1982.
18. P. McDaniel, S. Sen, O. Spatscheck, J. van der Merwe, B. Aiello, and C. Kalmanek. Enterprise security: A community of interest based approach. In NDSS, 2006.
19. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science. 1(2), 2005.
20. Cisco netflow. http://www.cisco.com/warp/public/cc/pd/iosw/ioft/neflct/ tech/napps_wp.htm.
21. J. Newsome, B. Karp, and D. Song. Polygraph: Automatically generating signatures for polymorphic worms. In Symposium on Security and Privacy, 2005.
22. C. Noble and D. Cook. Graph-based anomaly detection. In SIGKDD, 2003.
23. J. Novak, P. Raghavan, and A. Tomkins. Anti-aliasing on the web. In WWW, 2004.
24. D. Song, P. Venable, and A. Perrig. User recognition by keystroke latency pattern analysis. Technical Report. 1997.
25. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Relevance search and anomaly detection in bipartite graphs. SIGKDD Explorations Special Issue on Link Mining. 7(2):48-55, 2005.
26. Y. Xie, F. Yu, K. Achan, E. Gillum, M. Goldszmidt and T. Wobber How Dynamic are IP Addresses In SIGCOMM, 2007.
27. K. Xu, Z. Zhang, and S. Bhattacharyya. Profiling internet backbone traffic: behavior models and applications. SIGCOMM Comput. Commun. Rev., 35(4):169-180, 2005.