Sciweavers

15 search results - page 2 / 3
» Just how dense are dense graphs in the real world
Sort
View
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 5 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 2 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
ASUNAM
2011
IEEE
12 years 5 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 6 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
BERTINORO
2005
Springer
13 years 11 months ago
Self-Aware Software - Will It Become a Reality?
The possibility of building self-aware software fascinated computer scientist since the beginning of computer science. Research in AI, and in particular on software agents, agent s...
Péter András, Bruce G Charlton