Multi-location visibility query processing using portion-based transactional modeling and pattern mining

No abstract is available for this paper.

• Publication year

  2019

• Venue

  Data mining and knowledge discovery

• Publication date

  2019-07-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s10618-019-00641-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Top-k trajectories with the best view

  2019cited by this paper
• Efficient processing of maximum visibility facility selection query in spatial databases

  2017cited by this paper
• Reverse k-nearest neighbor search in the presence of obstacles

  2016cited by this paper
• Continuous Maximum Visibility Query for a Moving Target

  2016cited by this paper
• Mining coverage patterns from transactional databases

  2015cited by this paper
• Maximum visibility queries in spatial databases

  2013influential reference
• Discovering Coverage Patterns for Banner Advertisement Placement

  2012influential reference
• Group Visible Nearest Neighbor Queries in Spatial Databases

  2010influential reference
• Geometric and Engineering Drawing

  2010cited by this paper
• Incremental Evaluation of Visible Nearest Neighbor Queries

  2010influential reference
• Continuous visible nearest neighbor queries

  2009influential reference
• Continuous obstructed nearest neighbor queries in spatial databases

  2009cited by this paper
• Visible Reverse k-Nearest Neighbor Queries

  2009influential reference
• Frequent pattern mining: current status and future directions

  2007cited by this paper
• Visibility of disjoint polygons

  2005cited by this paper
• Spatial Queries in the Presence of Obstacles

  2004cited by this paper
• Geometric Intersection

  2004cited by this paper
• Algorithms for Visibility Computation on Terrains: A Survey

  2003cited by this paper
• HDoV-tree: the structure, the storage, the speed

  2003cited by this paper
• Continuous Nearest Neighbor Search

  2002influential reference
• Mining frequent patterns without candidate generation

  2000cited by this paper
• Mining association rules with multiple minimum supports

  1999influential reference
• Stars and Galaxies

  1998cited by this paper
• Fast Algorithms for Mining Association Rules in Large Databases

  1994cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• Coverage problems and visibility regions on topographic surfaces

  1990cited by this paper
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

  1980cited by this paper
• A Greedy Heuristic for the Set-Covering Problem

  1979cited by this paper
• Algorithms for Reporting and Counting Geometric Intersections

  1979cited by this paper
• Some simplified NP-complete problems

  1974influential reference

• A Comprehensive Incremental Framework to Extract Coverage Patterns from Dynamic Databases

  2022cites this paper
• Discovering Popular Paths and Management of Billboard Ads by Mining User Trajectory Data

  2021cites this paper
• An incremental framework to extract coverage patterns for dynamic databases

  2021cites this paper
• An Efficient Distributed Coverage Pattern Mining Algorithm

  2021cites this paper
• Multi-location Visibility Query and It’s Processing

  2020cites this paper
• MapReduce based and Incremental Approaches to Extract Coverage Patterns from Large Transactional Databases

  2020cites this paper
• Coverage Pattern Mining Based on MapReduce

  2020cites this paper