Sciweavers

197 search results - page 12 / 40
» Answering complex questions with random walk models
Sort
View
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
15 years 3 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...
INFOCOM
2006
IEEE
15 years 3 months ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha
CIKM
2008
Springer
14 years 11 months ago
Kernel methods, syntax and semantics for relational text categorization
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
Alessandro Moschitti
IPAW
2010
14 years 6 months ago
Provenance of Software Development Processes
Abstract. "Why does the build fail currently?" - This and similar questions arise on a daily basis in software development processes (SDP). There is no easy way to answer...
Heinrich Wendel, Markus Kunde, Andreas Schreiber
FOCI
2007
IEEE
15 years 3 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang