Sciweavers

1244 search results - page 70 / 249
» Cluster Based Personalized Search
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 6 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
163
Voted
ATAL
2007
Springer
15 years 8 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
CONTEXT
2007
Springer
15 years 8 months ago
Representing Context in Web Search with Ontological User Profiles
Abstract. One of the key factors for effective personalization of information access is the user context. We propose a framework which integrates several critical elements that mak...
Ahu Sieg, Bamshad Mobasher, Robin D. Burke
ISDA
2008
IEEE
15 years 10 months ago
Combining Clustering and Bayesian Network for Gene Network Inference
Gene network reconstruction is a multidisciplinary research area involving data mining, machine learning, statistics, ontologies and others. Reconstructed gene network allows us t...
Suhaila Zainudin, Safaai Deris
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl