Sciweavers

3245 search results - page 450 / 649
» Mining Transformed Data Sets
Sort
View
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
16 years 1 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
16 years 1 months ago
Latent Dirichlet Allocation and Singular Value Decomposition Based Multi-document Summarization
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
Rachit Arora, Balaraman Ravindran
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
16 years 28 days ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
GFKL
2007
Springer
196views Data Mining» more  GFKL 2007»
16 years 21 days ago
Comparison of Recommender System Algorithms Focusing on the New-item and User-bias Problem
Recommender systems are used by an increasing number of e-commerce websites to help the customers to find suitable products from a large database. One of the most popular techniqu...
Stefan Hauger, Karen H. L. Tso, Lars Schmidt-Thiem...
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
16 years 18 days ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney