|
Project-Related Papers
S. White and P. Smyth, Algorithms for Discovering Relative Importance In Graphs, Proceedings of the Ninth International ACM SIGKDD Conference, August 2003, June 2003.
T. Griffiths and M. Steyvers (in press). Finding Scientific Topics. Proceedings of the National Academy of Sciences
M. Steyvers, M. Rosen-Zvi, T. Griffiths, P. Smyth, Author Attribution with LDA, NIPS workshop on Syntax, Semantics, and Statistics, December 2003. (Not yet available.)
S. White and J. O’Madadhain, A Brief Guided Tour of the Java Universal Network/Graph Framework, invited presentation, Stanford Workshop on Statistical Inference, Computing and Visualization for Graphs, August 2003.
J. O'Madadhain, D. Fisher, S. White, and Y. Boey, The JUNG (Java Universal Network/Graph) Framework, UCI-ICS Tech Report 03-17, October 2003
Modeling the Internet and the Web: Probabilistic Methods and Algorithms, P. Baldi, P. Frasconi, and P. Smyth, Wiley, June 2003.
Note: Additional papers may be available to our sponsors and associated parties. To request access, email to a KDD point of contact.
|
