Sciweavers

42 search results - page 7 / 9
» A unified approach to ranking in probabilistic databases
Sort
View
CIKM
2008
Springer
13 years 8 months ago
Probabilistic polyadic factorization and its application to personalized recommendation
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
Yun Chi, Shenghuo Zhu, Yihong Gong, Yi Zhang
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 6 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
BMCBI
2006
195views more  BMCBI 2006»
13 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
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 7 months ago
Fuzzy Multi-Dimensional Search in the Wayfinder File System
With the explosion in the amount of semi-structured data users access and store, there is a need for complex search tools to retrieve often very heterogeneous data in a simple and ...
Amélie Marian, Christopher Peery, Thu D. Ng...
KDD
2008
ACM
211views Data Mining» more  KDD 2008»
14 years 6 months ago
ArnetMiner: extraction and mining of academic social networks
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zha...