Sciweavers

337 search results - page 26 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
ITA
2006
163views Communications» more  ITA 2006»
15 years 6 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
UAI
2008
15 years 7 months ago
Cumulative distribution networks and the derivative-sum-product algorithm
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
Jim C. Huang, Brendan J. Frey
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 6 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
WWW
2007
ACM
16 years 6 months ago
Information flow modeling based on diffusion rate for prediction and ranking
Information flows in a network where individuals influence each other. The diffusion rate captures how efficiently the information can diffuse among the users in the network. We p...
Xiaodan Song, Yun Chi, Koji Hino, Belle L. Tseng