{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:07:32Z","timestamp":1710331652652},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10618-019-00641-3","type":"journal-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T09:02:44Z","timestamp":1564131764000},"page":"1393-1416","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-location visibility query processing using portion-based transactional modeling and pattern mining"],"prefix":"10.1007","volume":"33","author":[{"given":"Lakshmi","family":"Gangumalla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"key":"641_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of VLDB, pp 487\u2013499"},{"key":"641_CR2","unstructured":"Ali D, Eunus M et\u00a0al (2017) Efficient processing of maximum visibility facility selection query in spatial databases. Masters Thesis, BUET"},{"issue":"1","key":"641_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T Asano","year":"1986","unstructured":"Asano T, Asano T, Guibas L, Hershberger J, Imai H (1986) Visibility of disjoint polygons. Algorithmica 1(1):49\u201363","journal-title":"Algorithmica"},{"key":"641_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"641_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"JL Bentley","year":"1979","unstructured":"Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput 28(9):643\u2013647","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"641_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"29","author":"JL Bentley","year":"1980","unstructured":"Bentley JL, Wood D (1980) An optimal worst case algorithm for reporting intersections of rectangles. IEEE Trans Comput 29(7):571\u2013577","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"641_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233\u2013235","journal-title":"Math Oper Res"},{"issue":"5","key":"641_CR8","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1068\/b12979","volume":"30","author":"L Floriani","year":"2003","unstructured":"Floriani L, Magillo P (2003) Algorithms for visibility computation on terrains: a survey. Environ Plan B Plan Des 30(5):709\u2013728","journal-title":"Environ Plan B Plan Des"},{"key":"641_CR9","unstructured":"Gangumalla L (2019) Datasets used in the paper. \n                    https:\/\/github.com\/lakshmi9414\/Datasets.git\n                    \n                  . Accessed 20 June 2019"},{"key":"641_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.ins.2015.10.022","volume":"330","author":"Y Gao","year":"2015","unstructured":"Gao Y, Liu Q, Miao X, Yang J (2015) Reverse k-nearest neighbor search in the presence of obstacles. Inf Sci 330:274\u2013292","journal-title":"Inf Sci"},{"key":"641_CR11","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B (2009) Continuous obstructed nearest neighbor queries in spatial databases. In: Proceedings of ACM SIGMOD, pp 577\u2013590","DOI":"10.1145\/1559845.1559906"},{"key":"641_CR12","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B, Chen G, Lee WC, Lee KCK, Li Q (2009a) Visible reverse k-nearest neighbor queries. In: Proceedings ICDE, pp 1203\u20131206","DOI":"10.1109\/ICDE.2009.201"},{"key":"641_CR13","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B, Lee WC, Chen G (2009b) Continuous visible nearest neighbor queries. In: Proceedings of EDBT, pp 144\u2013155","DOI":"10.1145\/1516360.1516378"},{"key":"641_CR14","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified NP-complete problems. In: Proceedings of ACM symposium on theory of computing, pp 47\u201363","DOI":"10.1145\/800119.803884"},{"issue":"1\u20134","key":"641_CR15","first-page":"175","volume":"18","author":"MF Goodchild","year":"1990","unstructured":"Goodchild MF, Lee J (1990) Coverage problems and visibility regions on topographic surfaces. Ann Oper Res 18(1\u20134):175\u2013186","journal-title":"Ann Oper Res"},{"issue":"3","key":"641_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10844-014-0318-3","volume":"45","author":"P Gowtham Srinivas","year":"2015","unstructured":"Gowtham Srinivas P et al (2015) Mining coverage patterns from transactional databases. J Intell Inf Syst 45(3):423\u2013439","journal-title":"J Intell Inf Syst"},{"key":"641_CR17","unstructured":"Haider CMR, Arman A, Ali ME, Choudhury FM (2016) Continuous maximum visibility query for a moving target. In: Proceedings of ADC, pp 82\u201394"},{"issue":"1","key":"641_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"641_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. SIGMOD Rec. 29(2):1\u201312","journal-title":"SIGMOD Rec."},{"key":"641_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10707-019-00343-4","volume":"141","author":"N Irtiza Tripto","year":"2019","unstructured":"Irtiza Tripto N, Nahar M, Ali ME, Choudhury F, Culpepper J, Sellis T (2019) Top-k trajectories with the best view. GeoInformatica 141:1\u201341. \n                    https:\/\/doi.org\/10.1007\/s10707-019-00343-4","journal-title":"GeoInformatica"},{"key":"641_CR21","doi-asserted-by":"crossref","unstructured":"Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proceedings of ACM SIGKDD, pp 337\u2013341","DOI":"10.1145\/312129.312274"},{"key":"641_CR22","doi-asserted-by":"crossref","unstructured":"Masud S, Choudhury FM, Ali ME, Nutanong S (2013) Maximum visibility queries in spatial databases. In: Proc. ICDE, pp. 637\u2013648","DOI":"10.1109\/ICDE.2013.6544862"},{"key":"641_CR23","doi-asserted-by":"publisher","DOI":"10.4324\/9780080967691","volume-title":"Geometric and engineering drawing 3E","author":"K Morling","year":"2010","unstructured":"Morling K (2010) Geometric and engineering drawing 3E. Routledge, London"},{"key":"641_CR24","doi-asserted-by":"crossref","unstructured":"Mount DM (2004) Geometric intersection. Citeseer","DOI":"10.1201\/9781420035315.ch38"},{"issue":"5","key":"641_CR25","first-page":"665","volume":"22","author":"S Nutanong","year":"2010","unstructured":"Nutanong S, Tanin E, Zhang R (2010) Incremental evaluation of visible nearest neighbor queries. IEEE TKDE 22(5):665\u2013681","journal-title":"IEEE TKDE"},{"key":"641_CR26","volume-title":"Stars and galaxies","author":"MA Seeds","year":"2015","unstructured":"Seeds MA, Backman D (2015) Stars and galaxies. Cengage Learning, Boston"},{"key":"641_CR27","doi-asserted-by":"crossref","unstructured":"Shou L, Huang Z, Tan KL (2003) HDoV-tree: the structure, the storage, the speed. In: Proceedings of ICDE, pp 557\u2013568","DOI":"10.1109\/ICDE.2003.1260821"},{"key":"641_CR28","doi-asserted-by":"crossref","unstructured":"Srinivas PG et al (2012) Discovering coverage patterns for banner advertisement placement. In: Proceedings of PAKDD, pp 133\u2013144","DOI":"10.1007\/978-3-642-30220-6_12"},{"key":"641_CR29","unstructured":"Tanton J (2005) Encyclopedia of mathematics. In: Tanton 2005 encyclopedia. Facts On File, inc"},{"key":"641_CR30","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of VLDB, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"641_CR31","doi-asserted-by":"crossref","unstructured":"Xu H, Li Z, Lu Y, Deng K, Zhou X (2010) Group visible nearest neighbor queries in spatial databases. In: Proceedings of WAIM, pp 333\u2013344","DOI":"10.1007\/978-3-642-14246-8_33"},{"key":"641_CR32","doi-asserted-by":"crossref","unstructured":"Zhang J, Papadias D, Mouratidis K, Zhu M (2004) Spatial queries in the presence of obstacles. In: Proceedings of EDBT, pp 366\u2013384","DOI":"10.1007\/978-3-540-24741-8_22"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00641-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00641-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00641-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T23:17:09Z","timestamp":1595632629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00641-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00641-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"assertion":[{"value":"26 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}