Network data mining and analysis: The NEMESIS project

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2336, Issue , 2002, Pages 1-12

  Garofalakis, Minos ^a   Rastogi, Rajeev ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; DATA MINING; DATA WAREHOUSES; DIGITAL STORAGE; NETWORK ARCHITECTURE; NETWORK MANAGEMENT; SEMANTICS; TREES (MATHEMATICS); WAREHOUSES;

CLASSIFICATION AND REGRESSION TREE MODELS; DATA MINING MODELS; LOSSY COMPRESSIONS; MASSIVE NETWORK DATUM; NETWORK DATA MINING; ROOT CAUSE ANALYSIS; SEMANTIC COMPRESSIONS; TRAFFIC ENGINEERING;

INFORMATION MANAGEMENT;

EID: 84900611480     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47887-6_1     Document Type: Conference Paper

References (14)

1. “NetFlow Services and Applications”. Cisco Systems White Paper, 1999.
2. S. Babu, M. Garofalakis, and R. Rastogi. “SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables”. In Proc. of the 2001 ACM SIGMOD Intl. Conf. on Management of Data, May 2001.
3. L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone. “Classification and Regression Trees”. Chapman & Hall, 1984.
4. A.L. Buchsbaum, D.F. Caldwell, K. Church, G.S. Fowler, and S. Muthukrishnan. “Engineering the Compression of Massive Tables: An Experimental Approach”. In Proc. of the 11th Annual ACM-SIAM Symp. on Discrete Algorithms, January 2000.
5. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. “Approximate Query Processing UsingWavelets”. In Proc. of the 26th Intl. Conf. on Very Large Data Bases, September 2000.
6. A. Deshpande, M. Garofalakis, and R. Rastogi. “Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data”. In Proc. of the 2001 ACM SIGMOD Intl. Conf. on Management of Data, May 2001.
7. C. Fraleigh, S. Moon, C. Diot, B. Lyles, and F. Tobagi. “Architecture of a Passive Monitoring System for Backbone IP Networks”. Technical Report TR00-ATL-101-801, Sprint Advanced Technology Laboratories, October 2000.
8. M.R. Garey and D.S. Johnson. “Computers and Intractability: A Guide to the Theory of NP-Completeness”. W.H. Freeman, 1979.
9. M.M. Halldórsson. “Approximations of Weighted Independent Set and Hereditary Subset Problems”. Journal of Graph Algorithms and Applications, 4(1), 2000.
10. H.V. Jagadish, J. Madar, and R. Ng. “Semantic Compression and Pattern Extraction with Fascicles”. In Proc. of the 25th Intl. Conf. on Very Large Data Bases, September 1999.
11. G. Jakobson and M.D. Weissman. “Alarm Correlation”. IEEE Network, November 1993.
12. Judea Pearl. “Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference”. Morgan Kaufmann Publishers, Inc., 1988.
13. William Stallings. “SNMP, SNMPv2, SNMPv3, and RMON 1 and 2”. Addison-Wesley Longman, Inc., 1999. (Third Edition).
14. S. Yemini, S. Kliger, E. Mozes, Y. Yemini, and D. Ohsie. “High Speed & Robust Event Correlation”. IEEE Communications Magazine, May 1996.