11910 search results - page 2207 / 2382 » Online Learning Algorithms |
185
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
207
Voted
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
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...
166
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
259
Voted
PSIVT
2009
Springer
16 years 1 months ago
2009
Springer
PCA-SIFT is an extension to SIFT which aims to reduce SIFT’s high dimensionality (128 dimensions) by applying PCA to the gradient image patches. However PCA is not a discriminati...
172
click to vote
HT
2009
ACM
16 years 1 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...