Princeton University Computer Science Dept.

Computer Science 598F Issues in Discovery & Use of Digital Information Andrea LaPaugh Schedule and Readings

Spring 2005

For general references and resources (texts,  journals and magazines, conferences and Web sites) please see General Resources

Schedule of topics and readings:

Mon. Jan. 31:  Introduction and organization

Wed. Feb 2: Information Retrieval  - background

• Mei Kobayashi and Koichi Takeda, "Information Retrieval on the Web", ACM Computing Surveys , Vol, 32 , No. 2  (June 2000), pp. 144 - 173.
  

• Efficient query evaluation using a two-level retrieval process  Andrei Z. Broder, David Carmel, Michael Herscovici, Aya Soffer, Jason Zien, CIKM 2003.
• Understanding User Goals in Web Search, D. E. Rose, D. Levinson, Yahoo! Inc. WWW 2004.

• (MOVED FROM LAST WED.) Evaluating high accuracy retrieval techniques, Chirag Shah, W. Bruce Croft, SIGIR 2004 .

• (MOVED FROM LAST WED.) On scaling latent semantic indexing for large peer-to-peer systems  Chunqiang Tang, Sandhya Dwarkadas, Zhichen Xur, SIGIR 2004.

• Content-based retrieval in hybrid peer-to-peer networks Jie Lu, Jamie Callan CIKM03

• (MOVED FROM MON.) What's New on the Web? The Evolution of the Web from a Search Engine PerspectiveA. Ntoulas, J. Cho, University of California at Los Angeles C. Olston, Carnegie Mellon University WWW 2004
• Link Fusion: A Unified Link Analysis Framework for Multi-Type Interrelated Data Objects  W. Xi, Virginia Polytechnic Institute and State University B. Zhang, Z. Chen, Microsoft Research Asia Y. Lu, S. Yan, Peking University W.-Y. Ma, Microsoft Research Asia E. A. Fox, Virginia Polytechnic Institute and State University WWW2004

• A survey of Web metrics  Devanshu Dhyani, Wee Keong Ng, Sourav S. Bhowmick ACM Computing Surveys  December 2002

• (MOVED FROM LAST WED.) Block-level link analysis  Deng Cai, Xiaofei He, Ji-Rong Wen, Wei-Ying Ma  SIGIR 2004  (Related paper:  Block-based web search  Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma  SIGIR 2004.)
• Monitoring the Dynamic Web to respond to Continuous Queries , Sandeep Pandey,  Krithi Ramamritham and Soumen Chakrabarti.  WWW 2003.  (Related paper: User-Centric Web Crawling , Sandeep Pandey and  Chris Olston. To appear in the 14th International World Wide Web Conference  (WWW 2005).

• STREAM: The Stanford Data Stream Management System,  Arasu, A.; Babcock, B.; Babu, S.; Cieslewicz, J.; Datar, M.; Ito, K.; Motwani, R,; Srivastava, U.; Widom, J.,  book chapter to appear;

• Combining link-based and content-based methods for web document classification Pável Calado, Marco Cristo, Edleno Moura, Nivio Ziviani, Berthier Ribeiro-Neto, Marcos André Gonçalves CIKM03
• Text Classification from Labeled and Unlabeled Documents using EM, K. Nigam, A. McCallum, S. Thrun, and T. Mitchell, Machine Learning (Kluwer, now Springer), 39(2 - 3) May 2000, pp.103 - 134.  (Note pdf or html available from given link to articlie summary page.)
  

• (MOVED FROM LAST WED.) Detecting Change in Data Streams.Dan Kifer, Shai Ben-David, and Johannes Gehrke, Proceedings of the 30th International Conference on Very Large Data Bases (VLDB 2004). Toronto, Canada. August 2004.  (presented by Anish Muttreja).
• Mining high-speed data streams  Pedro Domingos, Geoff Hulten, Conference on Knowledge Discovery in Data  (KDD) 2000, ACM.  (Related paper Accurate decision trees for mining high-speed data streams,  João Gama, Ricardo Rocha, Pedro Medas, KDD 2003.)
  

• On the use and performance of content distribution networks , Balachander Krishnamurthy, Craig Wills, Yin Zhang,  Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, 2001.
• Deploying Large File Transfer on an HTTP Content Distribution Network,  KyoungSoo Park, Vivek S. Pai, In Proceedings of the First Workshop on Real, Large, Distributed Systems (WORLDS '04) December 2004
  
• background for "Deploying Large ...":   Reliability and Security in the CoDeeN Content Distribution Network  (link to KyoungSoo Park's Web Site containing PDF) Limin Wang, KyoungSoo Park, Ruoming Pang, Vivek Pai, and Larry Peterson, USENIX Annual Technical Conference 2004.

•  Implications of proxy caching for provisioning networks and servers,   Mohammad S. Raunak, Prashant Shenoy, Pawan Goyal, Krithi Ramamritham, Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (SIGMETRICS 2000).
• Characterization of a Large Web Site Population with Implications for Content Delivery   L. Bent, University of California at San Diego, AT&T Labs-Research M. Rabinovich, AT&T Labs-Research G. M. Voelker, University of California at San Diego Z. Xiao, AT&T Labs-Research WWW2004

• Clustering Data Streams: Theory and Practice (link to Guha's paper list), Guha, S., A. Meyerson, N. Mishra, R. Motwani, and L. O'callaghan, IEEE Transactions on Knowledge and Data Engineering (IEEE TKDE).   Special issue on Online Analysis and Querying of Continuous Data Streams.  15(3): 515-528, 2003.  (Combines two conference papers:  Clustering data streams,  S. Guha, N. Mishra, R. Motwani, L. O'Callaghan, 41st Annual Symposium on Foundations of Computer Science (FOCS 2000) and Streaming-Data Algorithms for High-Quality Clustering, Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha,  18th International Conference on Data Engineering (ICDE'02) ) (Related paper:  Better Streaming Algorithms for Clustering Problems  (link to PostScript on Moses Charikar's site), M. Charikar, L. O'Callaghan and R. Panigrahy, Proc. of the ACM Symposium on Theory of Computing, 2003.  (improves Guha's k-median result).)

• (MOVED FROM MON.) Finding frequent items in data streams  Moses Charikar, Kevin Chen, Martin Farach-Colton, Theor. Comput. Sci. 312(1): 3-15 (2004), preliminary version in ICALP 2002: (link to PDF copy for COS 598E)    (link to PostScript on Moses Charikar's site ).

• Mining association rules between sets of items in large databases  Rakesh Agrawal, Tomasz Imieliński, Arun Swami, ACM SIGMOD 1993 (received 2003 SIGMOD "Test of Time Award" - judged to be best paper from 1993 SIGMOD 10 years later)
• Beyond Market Baskets: Generalizing Association Rules to Dependence Rules,  Craig Silverstein, Sergey Brin, Rajeev Motwani, Data Mining and Knowledge Discovery (DMKD), Volume 2, Number 1, Springer Science+Business Media B.V (formerly Kluwer Academic Publishers B.V.) January 1998 pp. 39 - 68.

• Model-Driven Data Acquisition in Sensor Networks,  Amol Deshpande, Carlos Guestrin, Samuel Madden, Joseph Hellerstein, Wei Hong , VLDB 2004 (best paper award).
  
• Best-Effort Cache Synchronization with Source Cooperation ,  C. Olston and J. Widom, ACM SIGMOD 2002.  (link is to longer Tech Report Version, from which we will work.  Exact SIGMOD Proceedings version is here.)

• Jie will present part of her Ph.D. dissertation work and may provide copies of the relevant chapters.

• Evaluation of hierarchical clustering algorithms for document datasets  Ying Zhao, George Karypis, CIKM 2002.

• Data clustering: a review, A. K. Jain, M. N. Murty, P. J. Flynn  ACM Computing Surveys,  Volume 31 Issue 3   September 1999, pp. 264 - 323.
• Techniques of Cluster Algorithms in Data Mining   Johannes Grabmeier and Andreas Rudolph  DMKD, V6, No 4, Oct 2002, pp. 303 - 360.

• Cyclic association rules Ozden, B.; Ramaswamy, S.; Silberschatz, A.    International Conference on  Data Engineering, IEEE, 1998, pp. 412-421.
  
• Mining Surprising Periodic Patterns Jiong Yang, Wei Wang, Philip S. Yu  Data Mining and Knowledge Discovery(DMKD), Volume 9, Number 2 September 2004  pp. 189 - 216.

• Efficient mining of partial periodic patterns in time series database Jiawei Han; Guozhu Dong; Yiwen Yin, International Conference on  Data Engineering, IEEE, 1999, pp. 106-115. 

• Graph Clustering and Minimum Cut Trees, G.W. Flake, R.E. Tarjan, K. Tsioutsiouliklis, , J. of Internet Mathematics (to appear?).
  
• review LSEARCH cluster algortihm in Clustering Data Streams: Theory and Practice (discussed March 28).
  

• Matching events in a content-based subscription system,  M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra, Proc. of ACM PODC, pp. 53-61,  May 1999.
• An efficient multicast protocol for content-based publish-subscribe systems, G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao, R.E. Strom, and D.C. Sturman, Proceedings of the 19th International
  Conference on Distributed Computing Systems (ICDCS), 1999, pp 262-272.
  

• The many faces of publish/subscribe Patrick Th. Eugster, Pascal A. Felber, Rachid Guerraoui, Anne-Marie Kermarrec  ACM Computing Surveys, June 2003

• Filtering algorithms and implementation for very fast publish/subscribe systems, F. Fabret, H.A. Jacobsen, F. Llirbat, J. Pereira, K.A. Ross, and D. Shasha, Proc. of ACM SIGMOD,  May 2001, pp. 115-126.
• New Algorithms for content-based publication-subscription systems, A. Riabov, Z. Liu, J. Wolf, P. Yu and L. Zhang, ICDCS 2003, pp. 678- 686.  (Related paper Clustering Algorithms for content-based publication-subscription systems, A. Riabov, Z. Liu, J. Wolf, P. Yu and L. Zhang,  ICDCS 2002, pp. 133-142.)

• Efficient event routing in content-based publish-subscribe service network, F. Cao, J. P. Singh, Proc. IEEE INFOCOM, 2004, Vol 2. pp. 929-940.
  
• pFilter: Global Information Filtering and Dissemination. Chunqiang Tang and Zhichen Xu., IEEE Workshop on Future Trends of  Distributed Computing Systems (FTDCS) 2003.