CMPSCI 691DD • Spring 2009 • Mon and Wed 2:05-3:20 • CMPS 140
Description • Schedule • Project • Reviewing Reports • Resources • Submission System
January | February | March | April | May
To access some of these readings, you will need either on-campus access,
or an OIT login to access them through the UMass library.
| Date/Topic | Reading |
Mon Jan 26 |
Watts, D. and S. Strogatz (1998). Collective dynamics of 'small world' networks. Nature 393: 440-442. [PDF] |
| (none) |
Tichy, W. (1998). Should computer scientists experiment more? IEEE Computer. May. 32-40. [PDF][Alt link] Denning, P. (2005). Is computer science science? Communications of the ACM. April. [PDF] |
|
Wed Feb 04 |
Loehle, C. (1990). A guide to increasing creativity in research - inspiration or perspiration? Bioscience 40:123-9. [PDF] |
Mon Feb 09 |
John, G. (1995). Robust decision trees: Removing outliers from databases. Knowledge Discovery and Data Mining. 174-179. [CiteSeer] |
Wed Feb 11 |
Tversky, A. and D. Kahneman (1974). Judgment under uncertainty: Heuristics and biases. Science 185:1124 - 1131.[PDF] |
Mon Feb 16 |
(none) |
Wed Feb 18 |
Oates, T. and D. Jensen (1997). The effects of training set size on decision tree complexity. In Proceedings of The Fourteenth International Conference on Machine Learning. 254-262. [PS] Optional: Oates, T. and D. Jensen (1999). Toward a theoretical understanding of why and when decision tree pruning algorithms fail. In Proceedings of the Sixteenth National Conference on Artificial Intelligence. 372-378. [PDF] |
Mon Feb 23 |
Platt, J.R. (1964). Strong inference. Science 146:347-353. [PDF] Optional: Chamberlain, T.C. (1965). The method of multiple working hypotheses. Science 148:754-759. Reprint from Science February 7, 1890. [PDF] |
Wed Feb 25 |
(none) |
Mon Mar 02 |
M. Liberatore, B. N. Levine, C. Barakat and C. Diot (2006). Maximizing transfer opportunities in Bluetooth DTNs. Proc. ACM Conference on Future Networking Technologies (CoNext). [PDF] |
Wed Mar 04 |
Medawar. P. B. (1963). Is the scientific paper a fraud? In P. B. Medawar. The Threat and the Glory. New York: Harper Collins. 228-233. [PDF] |
Mon Mar 09 |
M. Hertz and E. Berger (2005). Quantifying the performance of garbage collection vs. explicit memory management. Proceedings of the 20th annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications. 313-326.[CiteSeer] |
Wed Mar 11 |
Richard Hamming (1986). You and Your Research. [PDF] |
Mon Mar 16 |
(none) |
Wed Mar 18 |
(none) |
Mon Mar 23 |
L. Mackert and G. Lohman (1986). R* optimizer validation and performance evaluation for distributed queries. VLDB. 149-159. [PDF] |
Wed Mar 25 |
Sco tt Kirkpatrick and Bart Selman (1994). Critical behavior in the satisfiability of random Boolean expressions. Science 264:1297-1301. [PDF] |
Mon Mar 30 |
Domingos, P. and M. Pazzani (1997). On the optimality of the simple Bayesian classifier. Machine Learning 29:103-130. [PDF] |
Wed Apr 1 |
(none) |
Mon Apr 06 |
Ygge, F., and H. Akkermans (1999). Decentralized markets versus central control: A comparative study. Journal of Artificial Intelligence Research 11:301-333. [PDF] |
Wed Apr 08 |
D. Krioukov, K. Fall, and X. Yang (2004). Compact routing on Internet-like graphs. INFOCOM. [PDF] |
Mon Apr 13 |
Backstrom, L., D. Huttenlocher, J. Kleinberg, X. Lan (2006). Group formation in large social networks: Membership, growth, and evolution. Proc. 12th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. [PDF] |
Wed Apr 15 |
(none) |
Mon Apr 20 |
(none) |
Tue Apr 21 |
(none) |
Wed Apr 22 |
Jensen, D., and P. Cohen (2000). Multiple comparisons in induction algorithms. Machine Learning 38(3): 309-338. [PDF] |
Mon Apr 27 |
TBA |
Wed Apr 29 |
(none) |
Mon May 04 |
S. Blackburn et al. (2008). Wake up and smell the coffee: Evaluation methodology for the 21st Century. CACM. 51(8):83-89. [PDF] |
Wed May 06 |
(none) |
Mon May 11 |
(none) |