{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:46:10Z","timestamp":1769010370522,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146398","type":"print"},{"value":"9783642146404","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14640-4_6","type":"book-chapter","created":{"date-parts":[[2010,8,14]],"date-time":"2010-08-14T06:41:52Z","timestamp":1281768112000},"page":"76-98","source":"Crossref","is-referenced-by-count":2,"title":["Two Measures of Objective Novelty in Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/69.940730","volume":"13","author":"C.C. Aggarwal","year":"2001","unstructured":"Aggarwal, C.C., Yu, P.S.: A New Approach to Online Generation of Association Rules. IEEE Transactions on Knowledge and Data Engineering\u00a013, 527\u2013540 (2001) (See also ICDE 1998)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Very Large Databases. In: SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"6_CR3","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park"},{"key":"6_CR4","volume-title":"UCI Machine Learning Repository","author":"A. Asuncion","year":"2007","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"6_CR5","unstructured":"Balc\u00e1zar, J.L.: Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules (submitted for publication), Pascal Report 4259: http:\/\/eprints.pascal-network.org\/archive\/00004259 ; http:\/\/www.lsi.upc.edu\/~balqui\/papers.html"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Baralis, E., Chiusano, S., Garza, P.: On Support Thresholds in Associative Classification. In: ACM Symp. on Applied Computing, pp. 553\u2013558 (2004)","DOI":"10.1145\/967900.968016"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. In: ICDE 1999, pp. 188\u2013197 (1999)","DOI":"10.1109\/ICDE.1999.754924"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-31841-5_3","volume-title":"Knowledge Discovery in Inductive Databases","author":"J. Besson","year":"2005","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F.: Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 33\u201345. Springer, Heidelberg (2005)"},{"key":"6_CR9","unstructured":"Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Workshop on Frequent Itemset Mining Implementations (2003), borgelt.net"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Min. Knowl. Discov.\u00a07(1), 5\u201322 (2003)","journal-title":"Data Min. Knowl. Discov."},{"key":"6_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T. Calders","year":"2004","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.-F.: A Survey on Condensed Representations for Frequent Sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 64\u201380. Springer, Heidelberg (2004)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Ceglar, A., Roddick, J.F.: Association Mining. ACM Computing Surveys\u00a038 (2006)","DOI":"10.1145\/1132956.1132958"},{"key":"6_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/11430919_27","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Coenen","year":"2005","unstructured":"Coenen, F., Leng, P., Zhang, L.: Threshold Tuning for Improved Classification Association Rule Mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 216\u2013225. Springer, Heidelberg (2005)"},{"key":"6_CR14","unstructured":"Frequent Itemset Mining Implementations Repository, http:\/\/fimi.cs.helsinki.fi\/"},{"key":"6_CR15","first-page":"5","volume":"24","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Famille Minimale d\u2019Implications Informatives R\u00e9sultant d\u2019un Tableau de Donn\u00e9es Binaires. Math. et Sci. Humaines\u00a024, 5\u201318 (1986)","journal-title":"Math. et Sci. Humaines"},{"key":"6_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"6_CR17","unstructured":"Garriga, G.C.: Statistical Strategies for Pruning All the Uninteresting Association Rules. In: ECAI 2004, pp. 430\u2013434 (2004)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Geng, L., Hamilton, H.J.: Interestingness Measures for Data Mining: a Survey. ACM Comp. Surveys\u00a038 (2006)","DOI":"10.1145\/1132960.1132963"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0094834","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Guillaume","year":"1998","unstructured":"Guillaume, S., Guillet, F., Philipp\u00e9, J.: Improving the discovery of association rules with intensity of implication. In: \u017bytkow, J.M. (ed.) PKDD 1998. LNCS, vol.\u00a01510, pp. 318\u2013327. Springer, Heidelberg (1998)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0304-3975(02)00175-5","volume":"292","author":"P. H\u00e1jek","year":"2003","unstructured":"H\u00e1jek, P., Hole\u0148a, M.: Formal Logics of Discovery and Hypothesis Formation by Machine. Theoretical Computer Science\u00a0292, 345\u2013357 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-540-73499-4_40","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"C. H\u00e9bert","year":"2007","unstructured":"H\u00e9bert, C., Cr\u00e9milleux, B.: A Unified View of Objective Interestingness Measures. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol.\u00a04571, pp. 533\u2013547. Springer, Heidelberg (2007)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Kanimozhi Selvi, C.S., Tamilarasi, A.: Association Rule Mining with Dynamic Adaptive Support Thresholds for Associative Classification. In: IEEE Int. Conf. Comput. Intell. and Multimedia Appl., pp. 76\u201380 (2007)","DOI":"10.1109\/ICCIMA.2007.233"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H. Kautz","year":"1995","unstructured":"Kautz, H., Kearns, M., Selman, B.: Horn approximations of empirical data. Artificial Intelligence\u00a074, 129\u2013145 (1995)","journal-title":"Artificial Intelligence"},{"key":"6_CR24","unstructured":"Kawahara, M., Kawano, H.: Mining Association Algorithm with Threshold Based on ROC Analysis. In: IEEE Hawaii International Conference on System Sciences (2001)"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R. Khardon","year":"1996","unstructured":"Khardon, R., Roth, D.: Reasoning with models. Artificial Intelligence\u00a087, 187\u2013213 (1996)","journal-title":"Artificial Intelligence"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-64383-4_17","volume-title":"Research and Development in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Representative Association Rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol.\u00a01394, pp. 198\u2013209. Springer, Heidelberg (1998)"},{"key":"6_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-69115-4_30","volume-title":"Rough Sets and Current Trends in Computing","author":"M. Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Fast discovery of representative association rules. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol.\u00a01424, pp. 214\u2013221. Springer, Heidelberg (1998)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-44816-0_35","volume-title":"Advances in Intelligent Data Analysis","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Closed Set Based Discovery of Representative Association Rules. In: Hoffmann, F., Adams, N., Fisher, D., Guimar\u00e3es, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol.\u00a02189, pp. 350\u2013359. Springer, Heidelberg (2001)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Associations. In: KDD 1999, pp. 125\u2013134 (1999)","DOI":"10.1145\/312129.312216"},{"key":"6_CR30","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M.: Implications Partielles dans un Contexte. Math. et Sci. Humaines\u00a029, 35\u201355 (1991)","journal-title":"Math. et Sci. Humaines"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/JSAC.2002.1003039","volume":"20","author":"S. Ma","year":"2002","unstructured":"Ma, S., Hellerstein, J.L.: Mining Mutually Dependent Patterns for System Management. IEEE Journal on Selected Areas in Communications\u00a020, 726\u2013734 (2002)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"6_CR32","unstructured":"Megiddo, N., Srikant, R.: Discovering Predictive Association Rules. In: KDD 1998, pp. 274\u2013278 (1998)"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E.R. Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative Interest Measures for Mining Associations in Databases. IEEE Trans.\u00a0on Knowledge and Data Engineering\u00a015, 57\u201369 (2003)","journal-title":"IEEE Trans.\u00a0on Knowledge and Data Engineering"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a Condensed Representation for Association Rules. Journal of Intelligent Information Systems\u00a024, 29\u201360 (2005)","journal-title":"Journal of Intelligent Information Systems"},{"key":"6_CR35","unstructured":"Pfaltz, J.L., Taylor, C.M.: Scientific Discovery through Iterative Transformations of Concept Lattices. In: Workshop Discr.\u00a0Math.\u00a0and Data Mining, SDM 2002, pp. 65\u201374 (2002)"},{"key":"6_CR36","unstructured":"Phan-Luong, V.: The Representative Basis for Association Rules. In: ICDM 2001, pp. 639\u2013640 (2001)"},{"issue":"4","key":"6_CR37","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0306-4379(03)00072-3","volume":"29","author":"P.-N. Tan","year":"2004","unstructured":"Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the Right Objective Measure for Association Analysis. Inf. Syst.\u00a029(4), 293\u2013313 (2004)","journal-title":"Inf. Syst."},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1006\/aima.1994.1069","volume":"108","author":"M. Wild","year":"1994","unstructured":"Wild, M.: A Theory of Finite Closure Spaces Based on Implications. Adv. Math.\u00a0108, 118\u2013139 (1994)","journal-title":"Adv. Math."},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Xiong, H., Tan, P.-N., Kumar, V.: Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution. In: Third IEEE International Conference on Data Mining, ICDM 2003, p. 387 (2003)","DOI":"10.1109\/ICDM.2003.1250944"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M. Zaki","year":"2004","unstructured":"Zaki, M.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery\u00a09, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6_CR41","unstructured":"Zaki, M., Ogihara, M.: Theoretical foundations of association rules. In: Workshop on research issues in DMKD (1998)"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14640-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T13:20:42Z","timestamp":1740403242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14640-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146398","9783642146404"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14640-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}