Sciweavers

731 search results - page 96 / 147
» Taxonomy-superimposed graph mining
Sort
View
AOSD
2006
ACM
14 years 4 months ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
WEBI
2005
Springer
14 years 3 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 7 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
ICTAI
2006
IEEE
14 years 4 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King