Sciweavers

15 search results - page 1 / 3
» Mining Relaxed Graph Properties in Internet
Sort
View
IADIS
2004
13 years 6 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...
IOR
2011
175views more  IOR 2011»
12 years 12 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 5 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
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
13 years 6 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...