• Publications
  • Influence
A random walk method for alleviating the sparsity problem in collaborative filtering
TLDR
In this paper, we propose a novel item-oriented algorithm, Random Walk Recommender, that first infers transition probabilities between items based on their similarities and models finite length random walks on the item space to compute predictions. Expand
  • 180
  • 13
  • PDF
Algorithms for Generating Fundamental Cycles in a Graph
TLDR
The following problem is considered: Given an undirected, connected graph G, find a spanning tree in G such that the sum of the lengths of the fundamental cycles (with respect to this tree) is minimum. Expand
  • 118
  • 12
  • PDF
Finding communities by clustering a graph into overlapping subgraphs
TLDR
We present a new approach to the problem of finding communities: a community is a subset of actors who induce a locally optimal subgraph with respect to a density function defined on subsets of actors. Expand
  • 167
  • 10
  • PDF
Syntactic Segmentation and Labeling of Digitized Pages from Technical Journals
TLDR
A method for extracting alternating horizontal and vertical projection profiles are from nested sub-blocks of scanned page images of technical documents is discussed. Expand
  • 162
  • 9
A Mechanizable Induction Principle for Equational Specifications
TLDR
A new induction principle based on a constructor model of a data structure is used to construct automatically an induction scheme suitable for proving inductive properties of functions defined on inductively constructed data structures. Expand
  • 131
  • 6
LOGML: Log Markup Language for Web Usage Mining
TLDR
We propose two new XML applications, XGMML and LOGML to help us in this task. Expand
  • 66
  • 6
  • PDF
Fault diameter of interconnection networks
Abstract We introduce the concept of fault diameter of interconnection networks. The motivation is to estimate the degradation of performance under maximally fault conditions. We derive faultExpand
  • 179
  • 5
Modeling and Multiway Analysis of Chatroom Tensors
TLDR
This work identifies the limitations of n-way data analysis techniques in multidimensional stream data, such as Internet chat room communications data, and establishes a link between data collection and performance of these techniques. Expand
  • 142
  • 5
  • PDF
Fast parallel computation of hermite and smith forms of polynomial matrices
Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers.Expand
  • 83
  • 5
  • PDF
Graph Theoretic and Spectral Analysis of Enron Email Data
TLDR
Analysis of social networks to identify communities and model their evolution has been an active area of recent research. Expand
  • 116
  • 5
  • PDF
...
1
2
3
4
5
...