Sciweavers

731 search results - page 48 / 147
» Taxonomy-superimposed graph mining
Sort
View
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
CIKM
2008
Springer
13 years 9 months ago
The query-flow graph: model and applications
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...
INCDM
2007
Springer
121views Data Mining» more  INCDM 2007»
14 years 1 months ago
Collaborative Filtering Using Electrical Resistance Network Models
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
Jérôme Kunegis, Stephan Schmidt
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King