Sciweavers

243 search results - page 15 / 49
» Scalable mining of large disk-based graph databases
Sort
View
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 25 days ago
MaPle: A Fast Algorithm for Maximal Pattern-based Clustering
Pattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-...
Jian Pei, Xiaoling Zhang, Moonjung Cho, Haixun Wan...
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
13 years 5 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
ICDT
2001
ACM
124views Database» more  ICDT 2001»
13 years 12 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
COMAD
2009
13 years 8 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...