Continuous Similarity Computation over Streaming Graphs

No abstract is available for this paper.

• Publication year

  2013

• Venue

  ECML/PKDD

• Publication date

  2013-09-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-40988-2_41
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient jaccard-based diversity analysis of large document collections

  2012cited by this paper
• Continuous Top-k Dominating Queries

  2012cited by this paper
• gSketch: On Query Estimation in Graph Streams

  2011cited by this paper
• Continuous monitoring of distance-based outliers over data streams

  2011cited by this paper
• On Clustering Graph Streams

  2010cited by this paper
• Managing and Mining Graph Data

  2010cited by this paper
• Efficient join processing on uncertain data streams

  2009cited by this paper
• Algorithms for streaming graphs

  2009cited by this paper
• Community detection in graphs

  2009cited by this paper
• Efficient semi-streaming algorithms for local triangle counting in massive graphs

  2008cited by this paper
• Efficient similarity joins for near duplicate detection

  2008cited by this paper
• Efficient exact set-similarity joins

  2006cited by this paper
• Counting triangles in data streams

  2006cited by this paper
• Continuous monitoring of top-k queries over sliding windows

  2006cited by this paper
• Space efficient mining of multigraph streams

  2005cited by this paper
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence

  2005influential reference
• Data streams: algorithms and applications

  2005cited by this paper
• Optimal oblivious routing in polynomial time

  2003cited by this paper
• Querying and mining data streams: you only get one look a tutorial

  2002cited by this paper
• Syntactic Clustering of the Web

  1997cited by this paper
• Indefinite and maybe information in relational databases

  1990cited by this paper

• Edge-Connected Jaccard Similarity for Graph Link Prediction on FPGA

  2022cites this paper
• Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons

  2019cites this paper
• Streaming Similarity Self-Join

  2016cites this paper
• Scaling out-of-core K-Nearest Neighbors Computation on Single Machines. (Faire passer à l'échelle le calcul "out-of-core" des K-plus proche voisins sur une seule machine)

  2016cites this paper