Sciweavers

145 search results - page 18 / 29
» Discovery-driven graph summarization
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICDM
2007
IEEE
173views Data Mining» more  ICDM 2007»
14 years 4 months ago
Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
Ramesh Nallapati, Amr Ahmed, William W. Cohen, Eri...
METRICS
1999
IEEE
14 years 2 months ago
Measuring Coupling and Cohesion: An Information-Theory Approach
The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. O...
Edward B. Allen, Taghi M. Khoshgoftaar
ICCS
1998
Springer
14 years 2 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
NAACL
2007
13 years 11 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger