Sciweavers

ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
13 years 10 months ago
A Computational Approach to Style in American Poetry
We develop a quantitative method to assess the style of American poems and to visualize a collection of poems in relation to one another. Qualitative poetry criticism helped guide...
David M. Kaplan, David M. Blei
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
13 years 10 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
13 years 10 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
13 years 10 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
13 years 10 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
13 years 10 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
13 years 10 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
13 years 10 months ago
Language-Independent Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...
Richard C. Wang, William W. Cohen
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 10 months ago
Binary Matrix Factorization with Applications
An interesting problem in Nonnegative Matrix Factorization (NMF) is to factorize the matrix X which is of some specific class, for example, binary matrix. In this paper, we exten...
Zhongyuan Zhang, Tao Li, Chris H. Q. Ding, Xiangsu...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
13 years 10 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...