3250 search results - page 531 / 650 » Parameterized Learning Complexity |
130
Voted
ICB
2009
Springer
15 years 10 months ago
2009
Springer
Linear discriminant analysis (LDA) is a popular method in pattern recognition and is equivalent to Bayesian method when the sample distributions of different classes are obey to t...
142
click to vote
PKDD
2009
Springer
15 years 10 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...
119
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
116
Voted
HT
2009
ACM
15 years 10 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...
129
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...