BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An Introduction to Random Indexing - Jimme Jardine (University of 
 Cambridge)
DTSTART:20110224T120000Z
DTEND:20110224T130000Z
UID:TALK30064@talks.cam.ac.uk
CONTACT:Jimme Jardine
DESCRIPTION:The last time I spoke at the reading group\, Ted raised the po
 int that Random Indexing might do as well as other word space models witho
 ut any of the comlicated machinery.  Let's decide for ourselves...and besi
 des\, you will probably find that random indexing is useful to you!\n\nI w
 ill be covering the paper:\n@conference{sahlgren2005introduction\,\n  titl
 e={{An introduction to random indexing}}\,\n  author={Sahlgren\, M.}\,\n  
 booktitle={Methods and Applications of Semantic Indexing Workshop at the 7
 th International Conference on Terminology and Knowledge Engineering\, TKE
  2005}\,\n  year={2005}\,\n  organization={Citeseer}\n}\n\nWord space mode
 ls enjoy considerable attention in current research on se- mantic indexing
 . Most notably\, Latent Semantic Analysis/Indexing (LSA/LSI\; Deerwester e
 t al.\, 1990\, Landauer & Dumais\, 1997) has become a household name in in
 formation access research\, and deservedly so\; LSA has proven its mettle 
 in numerous applications\, and has more or less spawned an entire research
  field since its introduction around 1990. Today\, there is a rich flora o
 f word space models available\, and there are numerous publications that r
 eport exceptional results in many different applications\, including in- f
 ormation retrieval (Dumais et al.\, 1988)\, word sense disambiguation (Sch
 ütze\, 1993)\, various semantic knowledge tests (Lund et al.\, 1995\, Kar
 lgren & Sahlgren\, 2001)\, and text categorization (Sahlgren & Karlgren\, 
 2004).\n\nThis paper introduces the Random Indexing word space approach\, 
 which presents an efficient\, scalable and incremental alternative to stan
 dard word space methods. The paper is organized as follows: in the next se
 ction\, we re- view the basic word space methodology. We then look at some
  of the prob- lems that are inherent in the basic methodology\, and also r
 eview some of the solutions that have been proposed in the literature. In 
 the final section\, we in- troduce the Random Indexing word space approach
 \, and briefly review some of the experimental results that have been achi
 eved with Random Indexing.
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR