Sciweavers

878 search results - page 40 / 176
» Modeling Relational Data as Graphs for Mining
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 4 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
15 years 11 months ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
15 years 11 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 4 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
PREMI
2007
Springer
15 years 10 months ago
Discovery of Process Models from Data and Domain Knowledge: A Rough-Granular Approach
The rapid expansion of the Internet has resulted not only in the ever-growing amount of data stored therein, but also in the burgeoning complexity of the concepts and phenomena per...
Andrzej Skowron