Sciweavers

2227 search results - page 11 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
104
Voted
COMAD
2009
15 years 1 months ago
Modeling Relational Data as Graphs for Mining
The focus of this paper is to develop algorithms and a framework for modeling transactional data stored in relational database into graphs for mining. Most of the real-world trans...
Subhesh Pradhan, Sharma Chakravarthy, Aditya Telan...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 23 days 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
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
15 years 1 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
SDM
2012
SIAM
340views Data Mining» more  SDM 2012»
13 years 2 months ago
IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems
A Cyber-Physical System (CPS) integrates physical (i.e., sensor) devices with cyber (i.e., informational) components to form a situation-aware system that responds intelligently t...
Lu An Tang, Quanquan Gu, Xiao Yu, Jiawei Han, Thom...
113
Voted
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 23 days ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis