Sputtr.com | Alternative Search Engine

Subgraphs

Frequent Graph Discovery: Application to Line Drawing ...

This process finds frequent subgraphs and then association rules between these subgraphs. The distant aim is the automatic discovery of symbols and their relations, which are parts of the document model.

Information Marginalization on Subgraphs

Information Marginalization on Subgraphs Jiayuan Huang 1 , 2,Tings hao Z h u2, Russell Greiner 2, Dengyong Zho u 3, and Dale Schuurmans 2 1 University of Waterloo, Waterloo, Canada 2 University of Alberta, Edmonton, Canada 3 NEC Laboratories America, Inc. Abstract.

Connection Subgraphs in Social Networks

Connection Subgraphs in Social Networks Christos Faloutso s⁄ y KevinS. McCurley y Andrew Tomkin s y Abstract A connection subgraph isasmall (ie, viewable) subgraph of asocial network that best captures the relationship between two people.

Fast Discovery of Connection Subgraphs

Christos Faloutsos⁄, Kevin S. McCurley, and Andrew Tomkins IBMAlmaden Research Center

SPIN: Mining Maximal Frequent Subgraphs from Graph Databases

SPIN: Mining Maximal Frequent Subgraphs from Graph Databases 1 Jun Huan, 1 WeiWang, 1 Jan Prins, 2 Jiong Yang 1 Department of Computer Science, University of North Carolina at Chapel Hill Chapel Hill, NC 27599, USA 2 Department of Computer Science, University of Illinois at Urbana-Champaign ...

Knowledge Discovery in RDF graphs

1 Discovering Informative Connection Subgraphs in Multi-relational Graphs Cartic Ramakrishnan * cartic@cs.uga.edu William H. Milnor milnor@cs.uga.edu Matthew Perry * mperry@cs.uga.edu Amit P. Sheth * amit@cs.uga.edu * LSDIS Lab, University of Georgia, Athens GA ABSTRACT Discovering patterns in ...

Discovering Large Dense Subgraphs in Massive Graphs

Discovering Large Dense Subgraphs in Massive Graphs David Gibson Ravi Kumar Andrew Tomkins IBMAlmaden Research Center 650 HarryRoad San Jose, CA 95120 {davgib@us, ravi@almaden, tomkins@almaden}.ibm.com Abstract We present anew algorithm for finding large, dense subgraphs in massive graphs.

Center-Piece Subgraphs: Problem Definition and Fast Solutions

Center-Piece Subgraphs: Problem Definition and Fast Solutions Hanghang Tong Carnegie Mellon University htong@cs.cmu.edu Christos Faloutsos Carnegie Mellon University christos@cs.cmu. edu ABSTRACT Given Q nodes in asocial network (say, authorship network), how can we find the node/author that is ...

Random subgraphs of finite graphs: I. The scaling window ...

Random subgraphs of finite graphs: I. The scaling window under the triangle condition Christian Borg s ⁄Jennifer T. Chayes ⁄ Remcovander Hofsta d y Gordon Slad e z Joel Spence r x September 14,2004 Abstract We study random subgraphs of an arbitrary finite connected transitive ...

Nested Subgraphs of Complex Networks

SFIWorkingPaper Nested Subgraphs of Complex Networks Bernat Corominas-Murtr a1 Jos eF. F. Mendes 2 RicardV. Sol e 1; 3 1 ICREA-Complex Systems Lab, Universitat Pompeu Fabra, Dr. Aiguader 80,08003 Barcelona, Spain 2 Departamentode F sicadaUniversidade de Aveiro, 3810-193 Aveiro, Portugal 3 Santa ...