- talks - lists.cs.princeton.edu

Speaker tomorrow 11/7 -
by Ginny Hogan 06 Nov '07

06 Nov '07

Yuanyuan Zhou will present her talk "Taming Wild Concurrent Programs" tomorrow 11/7, at 4:15pm Computer Science Room 105.

1 0

Reminder: 1:30pm Thu Nov 1 talk on anomaly detection in CS 402
by Jennifer Rexford 31 Oct '07

31 Oct '07

SPEAKER: Nina Taft, Intel Research TITLE: Anomaly Detection in Large Networks using Approximation Techniques DATE/TIME: 1:30-2:30pm Thu Nov 1 PLACE: room 402 in the CS Building ABSTRACT: A tremendous enthusiasm for amassing enormous amounts of network measurement data has spurred the development of numerous applications that incorporate data mining techniques. In this talk we question the hidden assumption in these applications that one needs to collect "all the data all the time". We consider this question in the context of an anomaly detection application. We study the popular "Subspace method detector" that is based on PCA analysis. This method normally collects data from many parts of the network, centralizes the data, and then analyzes it to uncover anomalies. In our research, we ask whether we can throw away some of the data. Can we still do anomaly detection accurately without all the data? To avoid backhauling large amounts of data through networks, we present a framework that couples filtering at local monitors with centralized detectors that can operate on approximate views of the global data (i.e. network state). We show that the errors made by the central detector - due to the use of approximate data - can be upper bounded using matrix perturbation theory. The challenge is to design the filtering parameters; these are determined by the bound on detection errors and the criteria being tracked for detection. Our approximate anomaly detector can detect anomalies with 80 to 90% less data than the original method, and incurs less than a 1% reduction in detection accuracy. Finally, we comment on issues and future directions for data reduction in the context of anomaly detection. BIO Nina Taft is currently a senior research scientist at Intel Research Berkeley. At Intel she works focuses on enterprise network traffic characterization, anomaly detection at both the enterprise and host level, and approximation techniques for data mining algorithms. Prior to joining Intel, Nina worked at Sprint for 5 years in the IP Group working on backbone Internet measurement. She conducted research in various areas such as traffic matrix estimation, traffic characterization, routing protocols and IP-over-WDM network design problems. Prior to Sprint, Nina worked at SRI International for four years. There her work focused on congestion control and QoS routing in ATM networks. She received her PhD degree from the University of Berkeley in 1994. Nina is currently serving as an associate editor for the IEEE Transactions on Networking (ToN) journal, was SIGCOMM 2007 PC co-Chair, and is a member of the ACM Internet Measurement Conference (IMC) steering committee.

1 0

Refreshments -
by Ginny Hogan 25 Oct '07

25 Oct '07

Cookies are available in the tea room -

1 0

Speaker today
by Ginny Hogan 25 Oct '07

25 Oct '07

Alexander Razborov, IAS, will present his talk "Grand Challenges in Complexity Theory" at 4:30pm today Computer Science 105 - Tea will be at 3:30 -

1 0

Talk on Thursday 10/25 -
by Ginny Hogan 22 Oct '07

22 Oct '07

Alexander Razborov, IAS, will present his talk on Thursday, Oct. 25th at 4:30pm Computer Science Room 105.

1 0

refreshments
by Ginny Hogan 17 Oct '07

17 Oct '07

Refreshments are now available in the tea room -

1 0

Speaker Today -
by Ginny Hogan 17 Oct '07

17 Oct '07

Jon Bentley, Avaya Labs Research will present his talk "Three Beautiful Quicksorts" at 4:15pm today Computer Science room 105 - Tea will be at 3:30 -

1 0

Colloquium Speaker Wednesday 10/17/2007
by Ginny Hogan 15 Oct '07

15 Oct '07

Jon Bentley, Avaya Labs Research, will present his talk "Three Beautiful Quicksorts" on Wednesday 10/17/2007 4:15pm Computer Science Room 105 -

1 0

S Kale FPO
by Melissa M Lawson 15 Oct '07

15 Oct '07

Satyen Kale will present his FPO on Thursday October 18 at 3PM in Room 402. The members of his committee are Sanjeev Arora, advisor; Moses Charikar and Rob Schapire, readers; Bernard Chazelle and Boaz Barak, non readers. A copy of his thesis "Efficient Algorithms using the Multiplicative Weights Update Method" is on display in Room 310. Everyone is invited to attend his talk.

1 0

A Karagiozova FPO
by Melissa M Lawson 15 Oct '07

15 Oct '07

Adriana Karagiozova will present her FPO on Thursday October 18 at 9AM in Room 402. The members of her committee are Moses Charikar, advisor; Bernard Chazelle and Bob Tarjan, readers; Boaz Barak and Bob Sedgewick, non readers. A copy of her thesis "Aspects of Network Design" is on display in Room 310. Everyone is invited to attend her talk.

1 0