• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 828
Next 10 →

Search and replication in unstructured peer-to-peer networks

by Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker , 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract - Cited by 692 (6 self) - Add to MetaCart
propose a query algorithm based on multiple random walks that resolves queries almost as quickly as gnutella's flooding method while reducing the network traffic by two orders of mag-nitude in many cases. We also present a distributed replication strategy that yields close-to-optimal performance

The University of Florida sparse matrix collection

by Timothy A. Davis - NA DIGEST , 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract - Cited by 536 (17 self) - Add to MetaCart
and graphs, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, and power networks). The collection meets a vital need that artificially-generated matrices cannot meet, and is widely used by the sparse matrix algorithms community

Detecting the overlapping and hierarchical community structure in complex networks

by Andrea Lancichinetti, Santo Fortunato, János Kertész - New J. Phys. p , 2009
"... Abstract. Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most im ..."
Abstract - Cited by 149 (0 self) - Add to MetaCart
important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here we present the first algorithm that finds both overlapping communities

Empirical comparison of algorithms for network community detection

by Jure Leskovec, Kevin J. Lang, Michael W. Mahoney - In Proc. WWW’10 , 2010
"... Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses an objective function that captures the intuition of a network cluster as set of nodes with better internal connectivity ..."
Abstract - Cited by 171 (5 self) - Add to MetaCart
connectivity than external connectivity, and then one applies approximation algorithms or heuristics to extract sets of nodes that are related to the objective function and that “look like” good communities for the application of interest. In this paper, we explore a range of network community detection

Graph Cuts and Efficient N-D Image Segmentation

by Yuri Boykov, Gareth Funka-Lea , 2006
"... Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features ..."
Abstract - Cited by 307 (7 self) - Add to MetaCart
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features

Machine Learning Research: Four Current Directions

by Thomas G. Dietterich , 1997
"... Machine Learning research has been making great progress in many directions. This article summarizes four of these directions and discusses some current open problems. The four directions are (a) improving classification accuracy by learning ensembles of classifiers, (b) methods for scaling up super ..."
Abstract - Cited by 287 (0 self) - Add to MetaCart
supervised learning algorithms, (c) reinforcement learning, and (d) learning complex stochastic models. 1 Introduction The last five years have seen an explosion in machine learning research. This explosion has many causes. First, separate research communities in symbolic machine learning, computational

An Algorithm to Find Overlapping Community Structure in Networks

by Steve Gregory
"... Abstract. Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint communities, but in many real-world networks communities overlap to some extent. We present a new algorithm for disc ..."
Abstract - Cited by 71 (4 self) - Add to MetaCart
Abstract. Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint communities, but in many real-world networks communities overlap to some extent. We present a new algorithm

Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters

by Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney , 2008
"... A large body of work has been devoted to defining and identifying clusters or communities in social and information networks, i.e., in graphs in which the nodes represent underlying social entities and the edges represent some sort of interaction between pairs of nodes. Most such research begins wit ..."
Abstract - Cited by 208 (17 self) - Add to MetaCart
and information networks, and we come to several striking conclusions. Rather than defining a procedure to extract sets of nodes from a graph and then attempt to interpret these sets as a “real ” communities, we employ approximation algorithms for the graph partitioning problem to characterize as a function

Comparing Fuzzy Algorithms on Overlapping Communities in Networks

by Jian Liu
"... Abstract. Uncovering the overlapping community structure exhibited by real networks is a crucial step toward an understanding of complex systems that goes beyond the local organization of their constituents. Here three fuzzy c-means methods, based on optimal prediction, diffusion distance and dissi ..."
Abstract - Add to MetaCart
Abstract. Uncovering the overlapping community structure exhibited by real networks is a crucial step toward an understanding of complex systems that goes beyond the local organization of their constituents. Here three fuzzy c-means methods, based on optimal prediction, diffusion distance

Overlapping Communities in Social Networks

by Jan Dreier , Philipp Kuinke , Rafael Przybylski , Felix Reidl , Peter Rossmanith , Somnath Sikdar
"... Abstract Complex networks can be typically broken down into groups or modules. Discovering this "community structure" is an important step in studying the large-scale structure of networks. Many algorithms have been proposed for community detection and benchmarks have been created to eval ..."
Abstract - Add to MetaCart
in the network. In sparse networks with m = O(n) and a constant number of communities, this running time is almost linear in the size of the network. Another important feature of our algorithm is that it can be used for either non-overlapping or overlapping communities. We test our algorithm using the LFR
Next 10 →
Results 1 - 10 of 828
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University