Sciweavers

2100 search results - page 192 / 420
» Learning to rank on graphs
Sort
View
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
16 years 3 months ago
Pairwise Interaction Tensor Factorization for Personalized Tag Recommendation
Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization mo...
Steffen Rendle, Lars Schmidt-Thieme
BMCBI
2006
195views more  BMCBI 2006»
15 years 6 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
CSR
2009
Springer
16 years 1 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
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
WCRE
2007
IEEE
16 years 24 days ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke