{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:54:06Z","timestamp":1725497646769},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406037"},{"type":"electronic","value":"9783540451105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45110-2_98","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T09:04:48Z","timestamp":1197277488000},"page":"1998-2009","source":"Crossref","is-referenced-by-count":0,"title":["Connection Network and Optimization of Interest Metric for One-to-One Marketing"],"prefix":"10.1007","author":[{"given":"Sung-Soon","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 207\u2013216, 1993.","DOI":"10.1145\/170035.170072"},{"key":"98_CR2","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 255\u2013264, 1997.","DOI":"10.1145\/253260.253325"},{"key":"98_CR3","doi-asserted-by":"crossref","unstructured":"N. Shivakumar and H. Garcia-Molina. Building a scalable and accurate copy detection mechanism. In Proc. Third Int\u2019l Conf. Theory and Practice of Digital Libraries, 1996.","DOI":"10.1145\/226931.226961"},{"key":"98_CR4","doi-asserted-by":"crossref","unstructured":"A. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences Conf. (SEQUENCES\u201997), pages 21\u201329, 1998.","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"98_CR5","volume-title":"Pattern Classification and Scene Analysis","author":"R. O. Duda","year":"1973","unstructured":"R. O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley InterScience, New York, 1973."},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi, and K. Shim. CURE \u2014 an efficient clustering algorithm for large databases. In Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 73\u201384, 1998.","DOI":"10.1145\/276305.276312"},{"key":"98_CR7","unstructured":"D. Greening. Building Consumer Trust with Accurate Product Recommendations. LikeMinds White Paper LMWSWP-210-6966, 1997."},{"key":"98_CR8","doi-asserted-by":"crossref","unstructured":"C.C. Aggarwal, J.L. Wolf, K. Wu, and P.S. Yu. Horting hatches an egg: A new graph-theoretic approach to collaborative filtering. In Proc. of the fifth ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, pages 201\u2013212, 1999.","DOI":"10.1145\/312129.312230"},{"issue":"12","key":"98_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/138859.138867","volume":"35","author":"D. Goldberg","year":"1992","unstructured":"D. Goldberg, D. Nichols, B.M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Comm. of the ACM, 35(12):61\u201370, 1992.","journal-title":"Comm. of the ACM"},{"key":"98_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/245108.245126","volume":"40","author":"J.A. Konstan","year":"1997","unstructured":"J.A. Konstan et al. Grouplens: Applying collaborative filtering to usenet news. Comm. of the ACM, 40:77\u201387, 1997.","journal-title":"Comm. of the ACM"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"H.R. Varian and P. Resnick. CACM special issue on recommender systems. Comm. of the ACM, 40, 1997.","DOI":"10.1145\/245108.245121"},{"issue":"1","key":"98_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E. Cohen","year":"2001","unstructured":"E. Cohen et al. Finding interesting associations without support pruning. IEEE Trans. on Knowledge and Data Engineering, 13(1):64\u201378, 2001.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"98_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1009713703947","volume":"2","author":"C. Silverstein","year":"1998","unstructured":"C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2:69\u201396, 1998.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"98_CR14","unstructured":"C. Silverstein, S. Brin, R. Motwani, and J.D. Ullman. Scalable techniques for mining casual structures. In Proc. 24th Int\u2019l Conf. Very Large Data Bases, pages 594\u2013605, 1998."},{"key":"98_CR15","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo Jr. and R. Agrawal. Mining the most interesting rules. In Proc. of the fifth ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, pages 145\u2013154, 1999.","DOI":"10.1145\/312129.312219"},{"key":"98_CR16","doi-asserted-by":"crossref","unstructured":"T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, pages 13\u201323, 1996.","DOI":"10.1145\/235968.233313"},{"key":"98_CR17","unstructured":"G. Piatetsky-Shapiro. Discovery, Analysis, and Presentation of Strong Rules. AAAI\/MIT Press, 1991. Chapter 13 of Knowledge Discovery in Databases."},{"key":"98_CR18","doi-asserted-by":"crossref","unstructured":"S. Morishita. On classification and regression. In Proc. First Int\u2019l Conf. on Discovery Science \u2014 Lecture Notes in Artificial Intelligence 1532, pages 40\u201357, 1998.","DOI":"10.1007\/3-540-49292-5_4"},{"key":"98_CR19","unstructured":"Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tokuyama, and K. Yoda. Algorithms for mining association rules for binary segmentations of huge categorical databases. In Proc. of the 24th Very Large Data Bases Conf., pages 380\u2013391, 1998."},{"key":"98_CR20","unstructured":"P. Clark and P. Boswell. Rule induction with CN2: Some recent improvements. In Machine Learning: Proc. of the Fifth European Conference, pages 151\u2013163, 1991."},{"key":"98_CR21","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"G.I. Webb","year":"1995","unstructured":"G.I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431\u2013465, 1995.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"98_CR22","unstructured":"International Business Machines. IBM Intelligent Miner User\u2019s Guide, 1996. Version 1, Release 1."},{"key":"98_CR23","doi-asserted-by":"crossref","unstructured":"V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Trans. on Knowledge and Data Engineering, 5(6), 1993.","DOI":"10.1109\/69.250075"},{"key":"98_CR24","unstructured":"R. Dewan, B. Jing, and A. Seidmann. One-to-one marketing on the internet. In Proc. of the 20th Int\u2019l Conf. on Information Systems, pages 93\u2013102, 1999."},{"issue":"6","key":"98_CR25","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"M.S. Chen","year":"1996","unstructured":"M.S. Chen, P.S. Han, and J. Yu. Data mining: An overview from a database perspective. IEEE Trans. on Knowledge and Data Engineering, 8(6):866\u2013883, 1996.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"98_CR26","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/846170.846172","volume":"1","author":"M. Goebel","year":"1999","unstructured":"M. Goebel and L. Gruenwald. A survey of data mining and knowledge discovery software tools. SIGKDD Explorations, 1:20\u201333, 1999.","journal-title":"SIGKDD Explorations"},{"key":"98_CR27","doi-asserted-by":"crossref","unstructured":"J.L. Herlocker, J.A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proc. of the 22nd Annual Int\u2019l ACM SIGIR Conf. on Research and Development in Information Retrieval, pages 230\u2013237, 1999.","DOI":"10.1145\/312624.312682"},{"issue":"9","key":"98_CR28","first-page":"16","volume":"45","author":"V. Venugopal","year":"1994","unstructured":"V. Venugopal and W. Baets. Neural networks and their applications in marketing management. Journal of Systems Management, 45(9):16\u201321, 1994.","journal-title":"Journal of Systems Management"},{"key":"98_CR29","unstructured":"S. Park. Neural networks and customer grouping in e-commerce: A framework using fuzzy ART. In Proc. Academia\/Industry Working Conf. on Research Challenges\u2019 00, pages 331\u2013336, 2000."},{"key":"98_CR30","unstructured":"Y.K. Kwon and B.R. Moon. Personalized email marketing with a genetic programming circuit model. In Genetic and Evolutionary Computation Conference, pages 1352\u20131358, 2001."},{"issue":"3","key":"98_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.2307\/249775","volume":"17","author":"M.J. Culnan","year":"1993","unstructured":"M.J. Culnan. \u201cHow did they get my name?\u201d: An exploratory investigation of customer attitudes toward secondary information use. MIS Quarterly, 17(3):341\u2013363, 1993.","journal-title":"MIS Quarterly"},{"issue":"1","key":"98_CR32","first-page":"53","volume":"75","author":"J. Hagel III","year":"1997","unstructured":"J. III Hagel and J.F. Rayport. The coming battle for customer information. Havard Business Review, 75(1):53\u201365, 1997.","journal-title":"Havard Business Review"},{"key":"98_CR33","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer, 1992.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"98_CR34","volume-title":"Adaptive Search Using Simulated Evolution","author":"D. Cavicchio","year":"1970","unstructured":"D. Cavicchio. Adaptive Search Using Simulated Evolution. PhD thesis, University of Michigan, Ann Arbor, MI, 1970. Unpublished."},{"key":"98_CR35","unstructured":"D. Whitley and J. Kauth. Genitor: A different genetic algorithm. In Rocky Mountain Conf. on Artificial Intelligence, pages 118\u2013130, 1988."}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45110-2_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T16:45:47Z","timestamp":1557074747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45110-2_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406037","9783540451105"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-45110-2_98","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}