Sciweavers

11910 search results - page 2300 / 2382
» Online Learning Algorithms
Sort
View
SAC
2009
ACM
14 years 3 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
OOPSLA
2009
Springer
14 years 3 months ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie
JCDL
2009
ACM
179views Education» more  JCDL 2009»
14 years 3 months ago
Disambiguating authors in academic publications using random forests
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
Pucktada Treeratpituk, C. Lee Giles
SIGIR
2009
ACM
14 years 3 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
AIRWEB
2007
Springer
14 years 3 months ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
« Prev « First page 2300 / 2382 Last » Next »