Exploiting user clicks for automatic seed set generation for entity matching

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Knowledge Discovery and Data Mining

• Publication date

  2013-08-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/2487575.2487662
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Entity Resolution: Theory, Practice & Open Challenges

  2012cited by this paper
• Measuring website similarity using an entity-aware click graph

  2012cited by this paper
• Large-Scale Collective Entity Matching

  2011cited by this paper
• Ranking related entities for web search queries

  2011cited by this paper
• Approximate data instance matching: a survey

  2011cited by this paper
• Ranking Entities Using Web Search Query Logs

  2010cited by this paper
• Frameworks for entity matching: A comparison

  2010cited by this paper
• Pregel: a system for large-scale graph processing

  2010influential reference
• The paths more taken: matching DOM trees to search logs for accurate webpage clustering

  2010cited by this paper
• Query clustering using click-through graph

  2009cited by this paper
• Context-aware query suggestion by mining click-through and session data

  2008cited by this paper
• Random walks on the click graph

  2007cited by this paper
• Extracting semantic relations from query logs

  2007cited by this paper
• Adaptive Blocking: Learning to Scale Up Record Linkage

  2006cited by this paper
• Fast Random Walk with Restart and Its Applications

  2006cited by this paper
• Image annotation refinement using random walk with restarts

  2006cited by this paper
• Automatic multimedia cross-modal correlation discovery

  2004cited by this paper
• Adaptive duplicate detection using learnable string similarity measures

  2003cited by this paper
• Introduction to Algorithms, 2nd edition.

  2001cited by this paper
• Co-clustering documents and words using bipartite spectral graph partitioning

  2001cited by this paper
• Learning object identification rules for information integration

  2001cited by this paper
• A scalable comparison-shopping agent for the World-Wide Web

  1997cited by this paper
• Introduction to algorithms

  1996cited by this paper
• A comparison of parallel algorithms for connected components

  1994cited by this paper
• Estimation of sparse jacobian matrices and graph coloring problems

  1983cited by this paper

• COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency

  2015cites this paper
• Incorporating Social Context and Domain Knowledge for Entity Recognition

  2015cites this paper