{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:58:09Z","timestamp":1760241489731,"version":"build-2065373602"},"reference-count":44,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T00:00:00Z","timestamp":1523318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Association rule (AR) mining represents a challenge in the field of data mining. Mining ARs using traditional algorithms generates a large number of candidate rules, and even if we use binding measures such as support, reliability, and lift, there are still several rules to keep, and domain experts are needed to extract the rules of interest from the remaining rules. The focus of this paper is on whether we can directly provide rule rankings and calculate the proportional relationship between the items in the rules. To address these two questions, this paper proposes a modified FP-Growth algorithm called FP-GCID (novel FP-Growth algorithm based on Cluster IDs) to generate ARs; in addition, a new method called Mean-Product of Probabilities (MPP) is proposed to rank rules and compute the proportion of items for one rule. The experiment is divided into three phases: the DBSCAN (Density-Based Scanning Algorithm with Noise) algorithm is used to cluster the geographic interest points and map the obtained clusters into corresponding transaction data; FP-GCID is used to generate ARs, which contain cluster information; and MPP is used to choose the best rule based on the rankings. Finally, a visualization of the rules is used to validate whether the two previously stated requirements were fulfilled.<\/jats:p>","DOI":"10.3390\/ijgi7040146","type":"journal-article","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T13:06:08Z","timestamp":1523365568000},"page":"146","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Method of Mining Association Rules for Geographical Points of Interest"],"prefix":"10.3390","volume":"7","author":[{"given":"Shiwei","family":"Lian","sequence":"first","affiliation":[{"name":"School of Geographic Spatial Information, University of Information Engineering, Zhengzhou 450000, China"},{"name":"The Unit 31682 of Lanzhou, Lanzhou 730000, China"}]},{"given":"Jinning","family":"Gao","sequence":"additional","affiliation":[{"name":"The Unit 31682 of Lanzhou, Lanzhou 730000, China"}]},{"given":"Hongwei","family":"Li","sequence":"additional","affiliation":[{"name":"School of Geographic Spatial Information, University of Information Engineering, Zhengzhou 450000, China"},{"name":"Intellectual City Research Institute of Zhengzhou University, Zhengzhou 450000, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s13198-012-0121-x","article-title":"Clustering and association rules in analyzing the efficiency of maintenance system of an urban bus network","volume":"3","author":"Maquee","year":"2012","journal-title":"Int. J. Syst. Assur. Eng. Manag."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10844-013-0286-z","article-title":"Detecting intrusion transactions in database systems: A novel approach","volume":"42","author":"Sohrabi","year":"2014","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1013284820704","article-title":"Efficient adaptive-support association rule mining for recommender systems","volume":"6","author":"Lin","year":"2002","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s13721-014-0050-5","article-title":"Significant patterns for oral cancer detection: Association rule on clinical examination and history data","volume":"3","author":"Sharma","year":"2014","journal-title":"Netw. Model. Anal. Health Inform. Bioinform."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00170-011-3787-3","article-title":"An association rule mining and maintaining approach in dynamic database for aiding product\u2013service system conceptual design","volume":"62","author":"Geng","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., and Swami, A. (1993, January 26\u201328). Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","DOI":"10.1145\/170035.170072"},{"key":"ref_7","unstructured":"Agrawal, R., and Srikant, R. (1994, January 12\u201315). Fast algorithms for mining association rules. Proceedings of the 20th International Conference Very Large Data Bases, VLDB, Santiago, Chile."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., and Yin, Y. (2000, January 16\u201318). Mining frequent patterns without candidate generation. Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, USA.","DOI":"10.1145\/342009.335372"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","article-title":"Frequent pattern mining: Current status and future directions","volume":"15","author":"Han","year":"2007","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_11","first-page":"57","article-title":"Knowledge discovery in databases: An overview","volume":"13","author":"Frawley","year":"1992","journal-title":"AI Mag."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Freitas, A.A. (1998, January 23\u201326). On objective measures of rule surprisingness. Proceedings of the European Symposium on Principles of Data Mining and Knowledge Discovery, Nantes, France.","DOI":"10.1007\/BFb0094799"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0167-9236(99)00053-6","article-title":"Unexpectedness as a measure of interestingness in knowledge discovery","volume":"27","author":"Padmanabhan","year":"1999","journal-title":"Decis. Support Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/B:FODM.0000022043.43885.55","article-title":"A framework for evaluating knowledge-based interestingness of association rules","volume":"3","author":"Shekar","year":"2004","journal-title":"Fuzzy Optim. Decis. Mak."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Al-Hegami, A.S., Bhatnagar, V., and Kumar, N. (2004, January 1\u20133). Novelty framework for knowledge discovery in databases. Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Zaragoza, Spain.","DOI":"10.1007\/978-3-540-30076-2_5"},{"key":"ref_16","first-page":"18","article-title":"Novelty as a measure of interestingness in knowledge discovery","volume":"9","author":"Bhatnagar","year":"2006","journal-title":"Constraints"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2006.10.059","article-title":"On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid","volume":"184","author":"Lenca","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996, January 2\u20134). A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trc.2013.07.010","article-title":"Mining smart card data for transit riders\u2019 travel patterns","volume":"36","author":"Ma","year":"2013","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.protcy.2012.10.058","article-title":"A prototype-based modified DBSCAN for gene clustering","volume":"6","author":"Edla","year":"2012","journal-title":"Procedia Technol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.proenv.2015.03.018","article-title":"Hotspot distribution analyses based on peat characteristics using density-based spatial clustering","volume":"24","author":"Usman","year":"2015","journal-title":"Procedia Environ. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5154","DOI":"10.1016\/j.eswa.2010.10.047","article-title":"An improved frequent pattern growth method for mining association rules","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., and Ma, Y. (1999, January 15\u201318). Mining association rules with multiple minimum supports. Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA.","DOI":"10.1145\/312129.312274"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dss.2004.09.007","article-title":"Mining association rules with multiple minimum supports: A new mining algorithm and a support tuning mechanism","volume":"42","author":"Hu","year":"2006","journal-title":"Decis. Support Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","article-title":"An effective tree structure for mining high utility itemsets","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","article-title":"Mining itemset utilities from transaction databases","volume":"59","author":"Yao","year":"2006","journal-title":"Data Knowl. Eng."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., and Butz, C.J. (2004, January 22\u201324). A foundational approach to mining itemset utilities from databases. Proceedings of the 2004 SIAM International Conference on Data Mining, Lake Buena Vista, FL, USA.","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/568574.568581","article-title":"Exploiting succinct constraints using FP-trees","volume":"4","author":"Leung","year":"2002","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"ref_29","first-page":"231","article-title":"MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery","volume":"5","author":"Lin","year":"2010","journal-title":"Int. J. Bus. Intell. Data Min."},{"key":"ref_30","unstructured":"Cheung, W., and Zaiane, O.R. (2003, January 16\u201318). Incremental mining of frequent patterns without candidate generation or support constraint. Proceedings of the Seventh International Database Engineering and Applications Symposium, Los Alamitos, CA, USA."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Koh, J.-L., and Shieh, S.-F. (2004, January 17\u201319). An efficient approach for maintaining association rules based on adjusting FP-tree structures. Proceedings of the International Conference on Database Systems for Advanced Applications, Jeju Island, Korea.","DOI":"10.1007\/978-3-540-24571-1_38"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","article-title":"CanTree: A canonical-order tree for incremental frequent-pattern mining","volume":"11","author":"Leung","year":"2007","journal-title":"Knowl. Inform. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","article-title":"Efficient single-pass frequent pattern mining using a prefix-tree","volume":"179","author":"Tanbeer","year":"2009","journal-title":"Inform. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.eswa.2005.09.015","article-title":"Improving associative classification by incorporating novel interestingness measures","volume":"31","author":"Lan","year":"2006","journal-title":"Expert Syst. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"5137","DOI":"10.1016\/j.eswa.2008.06.028","article-title":"Interestingness filtering engine: Mining Bayesian networks for interesting patterns","volume":"36","author":"Malhas","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"11630","DOI":"10.1016\/j.eswa.2011.03.042","article-title":"Interestingness measures for association rules: Combination between lattice and hash tables","volume":"38","author":"Vo","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.knosys.2010.11.005","article-title":"Interestingness measures for association rules based on statistical validity","volume":"24","author":"Shaharanee","year":"2011","journal-title":"Knowl.-Based Syst."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.artmed.2007.07.005","article-title":"Evaluation of rule interestingness measures in medical knowledge discovery in databases","volume":"41","author":"Ohsaki","year":"2007","journal-title":"Artif. Intell. Med."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Zhang, C., and Zhang, S. (2004, January 4\u20136). Discovering interesting association rules by clustering. Proceedings of the Australasian Joint Conference on Artificial Intelligence, Cairns, Australia.","DOI":"10.1007\/978-3-540-30549-1_101"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Lee, I., Cai, G., and Lee, K. (2013, January 7\u201310). Mining points-of-interest association rules from geo-tagged photos. Proceedings of the 2013 46th International Conference on System Sciences (HICSS), Wailea, HI, USA.","DOI":"10.1109\/HICSS.2013.401"},{"key":"ref_41","unstructured":"Han, E.-H., Karypis, G., Kumar, V., and Mobasher, B. (1997, January 11). Clustering based on association rule hypergraphs. Proceedings of the Workshop on Research Issues on Data Mining and Knowledge Discovery, Tucson, AZ, USA."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. (1997, January 14\u201317). New Algorithms for Fast Discovery of Association Rules. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, Newport Beach, CA, USA.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"ref_43","unstructured":"Lent, B., Swami, A., and Widom, J. (1997, January 7\u201311). Clustering association rules. Proceedings of the 13th International Conference on Data Engineering, Birmingham, UK."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/92.748202","article-title":"Multilevel hypergraph partitioning: Applications in VLSI domain","volume":"7","author":"Karypis","year":"1999","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/7\/4\/146\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:00:15Z","timestamp":1760194815000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/7\/4\/146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,10]]},"references-count":44,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["ijgi7040146"],"URL":"https:\/\/doi.org\/10.3390\/ijgi7040146","relation":{},"ISSN":["2220-9964"],"issn-type":[{"type":"electronic","value":"2220-9964"}],"subject":[],"published":{"date-parts":[[2018,4,10]]}}}