Sciweavers

2137 search results - page 211 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
14 years 2 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 9 months ago
Link Graph Analysis for Adult Images Classification
In order to protect an image search engine's users from undesirable results adult images' classifier should be built. The information about links from websites to images...
Evgeny Kharitonov, Anton Slesarev, Ilya Muchnik, F...
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
13 years 7 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...
JMLR
2012
11 years 11 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 2 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...