{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:00:58Z","timestamp":1742389258404},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T00:00:00Z","timestamp":1157068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10844-006-2618-8","type":"journal-article","created":{"date-parts":[[2006,9,7]],"date-time":"2006-09-07T19:31:21Z","timestamp":1157657481000},"page":"135-158","source":"Crossref","is-referenced-by-count":17,"title":["An efficient approach to mining indirect associations"],"prefix":"10.1007","volume":"27","author":[{"given":"Qian","family":"Wan","sequence":"first","affiliation":[]},{"given":"Aijun","family":"An","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,7]]},"reference":[{"key":"2618_CR1","unstructured":"Agarwal, R., & Strikant, R. (1994, September) Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases Santiago, Chile (pp. 487\u2013499)."},{"key":"2618_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Imielinski, T., & Swami, A. (1993, May). Mining association rules between sets of items in large databases. In Proceedings ACM SIGMOD International Conference on Management of Data Washington, District of Columbia, USA (pp. 207\u2013216).","DOI":"10.1145\/170035.170072"},{"key":"2618_CR3","unstructured":"Agarwal, R., Aggarwal, C., & Prasad, V. V. V. (2000). A tree projection algorithm for generation of frequent itemsets. In Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining)."},{"key":"2618_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. (May, 1998). Efficiently mining long patterns from databases. In Proceedings of the International ACM SIGMOD Conference (pp. 85\u201393).","DOI":"10.1145\/276304.276313"},{"key":"2618_CR5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., & Tsur, S. (May, 1997). Dynamic itemset counting and implication rules for market basket data. In Proceedings of the International ACM SIGMOD Conference (pp. 255\u2013264). Tucson, Arizona, USA.","DOI":"10.1145\/253260.253325"},{"key":"2618_CR6","unstructured":"Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery: An overview. In AAAI Press\/MIT Press (Eds.), Advances in Knowledge Discovery and Data Mining (pp. 1\u201336)."},{"key":"2618_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (May, 2000). Mining frequent patterns without candidate generation. In Proceedings of ACM-SIGMOD International Conference on Management of Data (pp. 1\u201312). Dallas, Texas.","DOI":"10.1145\/342009.335372"},{"key":"2618_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Journal of Data Mining and Knowledge Discovery, 8, 53\u201387.","journal-title":"Journal of Data Mining and Knowledge Discovery"},{"key":"2618_CR9","unstructured":"Huang, X., An, A., & Cercone, N. (2002a). Evaluation of interestingness measures in a real world application. In submitted for Journal publication."},{"key":"2618_CR10","unstructured":"Huang, X., An, A., Cercone, N., & Promhouse, G. (2002b). Discovery of interesting association rules from livelink web log data. In Proceedings of IEEE International Conference on Data Mining. Maebashi City, Japan."},{"key":"2618_CR11","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., & Han, J. (2002, July). Mining frequent itemsets by opportunistic projection. In Proceedings of ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Canada.","DOI":"10.1145\/775079.775081"},{"key":"2618_CR12","unstructured":"Mannila, H., Toivonen, H., & Verkamo, A. I. (1994, July). Efficient algorithms for discovering association rules. In AAAI Workshop on Knowledge Discovery in Databases (pp. 181\u2013192)."},{"key":"2618_CR13","doi-asserted-by":"crossref","unstructured":"Park, J. S., Chen, M. S., & Yu, P. S. (May, 1995). An effective hash-based algorithm for mining association rules. In Proceedings of ACM-SIGMOD International Conference on Management of Data. San Jose, California.","DOI":"10.1145\/223784.223813"},{"key":"2618_CR14","unstructured":"Pei, J. (2002). Pattern-growth methods for frequent pattern mining. PhD thesis, Simon Fraser University."},{"key":"2618_CR15","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., & Yang, D. (2001, November). H-mine: Hyper-structure mining of frequent patterns in large database. In Proceedings of the IEEE International Conference on Data Mining. San Jose, California."},{"key":"2618_CR16","unstructured":"Savasere, A., Omiecinski, E., & Navathe, S. (1995, September). An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases. Zurich, Switzerland."},{"key":"2618_CR17","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., & Navathe, S. (1998, February). Mining for strong negative associations in a large database of customer transactions. In Proceedings of the 14th International Conference on Data Engineering (pp. 494\u2013502). Orlando, Florida.","DOI":"10.1109\/ICDE.1998.655812"},{"key":"2618_CR18","unstructured":"Tan, P., & Kumar, V. (2000, August). Interestingness measures for association patterns: A perspective. In KDD 2000 Workshop on Postprocessing in Machine Learning and Data Mining. Boston, Massachusetts."},{"key":"2618_CR19","doi-asserted-by":"crossref","unstructured":"Tan, P., & Kumar, V. (2001, August). Mining indirect associations in web data. In Proc of WebKDD2001: Mining Log Data Across All Customer TouchPoints.","DOI":"10.1007\/3-540-45640-6_7"},{"key":"2618_CR20","doi-asserted-by":"crossref","unstructured":"Tan, P., Kumar, V., & Srivastava, J. (2000). Indirect association: Mining higher order dependencies in data. In Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (pp. 632\u2013637). Lyon, France.","DOI":"10.1007\/3-540-45372-5_77"},{"key":"2618_CR21","unstructured":"Tan, P., Kumar, V., & Kuno, H. (2001). Using sas for mining indirect associations in data. In Proc of the Western Users of SAS Software Conference."},{"key":"2618_CR22","doi-asserted-by":"crossref","unstructured":"Tan, P., Kumar, V., & Srivastava, J. (2002, July). Selecting the right interestingness measure for association patterns. In Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining. Edmonton, Canada.","DOI":"10.1145\/775047.775053"},{"key":"2618_CR23","doi-asserted-by":"crossref","unstructured":"Wan, Q., & An, A. (2003, June). Efficient mining of indirect associations using hi-mine. In Proceedings of 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003. Halifax, Canada.","DOI":"10.1007\/3-540-44886-1_17"},{"issue":"3","key":"2618_CR24","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/69.929898","volume":"13","author":"Wong","year":"2001","unstructured":"Wong, & Butz, C. J. (2001). Constructing the dependency structure of a multi-agent probability network. IEEE Transactions on Knowledge and Data Engineering, 13(3), 395\u2013415.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2618_CR25","unstructured":"Wu, X., Zhang, C., & Zhang, S. (2002, July). Mining both positive and negative association rules. In Proceedings of the 19th International Conference on Machine Learning (ICML-2002) (pp. 658\u2013665). Sydney, Australia."},{"key":"2618_CR26","unstructured":"Zaki, M., & Orihara, M. (1998, June). Theoretical foundations of association rules. In Proceedings of the 3rd ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. Seattle, Washington."},{"key":"2618_CR27","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., & Mason, L. (2001, August). Real world performance of association rule algorithms. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, California.","DOI":"10.1145\/502512.502572"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-006-2618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-006-2618-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-006-2618-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:10:46Z","timestamp":1559268646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-006-2618-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["2618"],"URL":"https:\/\/doi.org\/10.1007\/s10844-006-2618-8","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}