{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:08Z","timestamp":1760596208161,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278917"},{"type":"electronic","value":"9783540318811"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11528784_10","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T03:24:54Z","timestamp":1285644294000},"page":"180-195","source":"Crossref","is-referenced-by-count":44,"title":["Efficient Mining of Association Rules Based on Formal Concept Analysis"],"prefix":"10.1007","author":[{"given":"Lotfi","family":"Lakhal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Stumme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proceedings of the 1993 ACM SIGMOD international conference on Management of Data (SIGMOD 1993)","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of Data (SIGMOD 1993), May 1993, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"10_CR2","first-page":"478","volume-title":"Proceedings of the 20th international conference on Very Large Data","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on Very Large Data, September 1994, pp. 478\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/ICDE.1995.380415","volume-title":"Proceedings of the 11th International Conference on Data Engineering (ICDE 1995)","author":"R. Agrawal","year":"1995","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the 11th International Conference on Data Engineering (ICDE 1995), March 1995, pp. 3\u201314. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"10_CR4","unstructured":"Bastide, Y.: Data Mining: algorithmes par niveau, techniques d\u2019implementation et applications. PhD thesis, Universit\u00e9 de Clermont-Ferrand II (2000)"},{"issue":"2","key":"10_CR5","first-page":"71","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations, Special Issue on Scalable Algorithms\u00a02(2), 71\u201380 (2000)","journal-title":"SIGKDD Explorations, Special Issue on Scalable Algorithms"},{"key":"10_CR6","unstructured":"Bay, S.D.: The UCI KDD Archive. Technical report, University of California, Department of Information and Computer Science, Irvine, 99, http:\/\/kdd.ics.uci.edu"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276304.276313","volume-title":"Proceedings of the 1998 ACM SIGMOD international conference on Management of Data (SIGMOD 1998)","author":"R.J. Bayardo","year":"1998","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of Data (SIGMOD 1998), June 1998, pp. 85\u201393. ACM Press, New York (1998)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proceedings of the 4th IEEE International Conference on Data Mining, pp. 35\u201342. IEEE Computer Society, Los Alamitos (2004)","DOI":"10.1109\/ICDM.2004.10093"},{"key":"10_CR9","first-page":"31","volume":"96","author":"J.P. Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de galois d\u2019une correspondance Galois. Math. Sci. Hum.\u00a096, 31\u201347 (1986)","journal-title":"Math. Sci. Hum."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"PADKK 2000: Proceedings of the 4th Pacific- Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: PADKK 2000: Proceedings of the 4th Pacific- Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, London, UK, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Jean-Francois Boulicaut, Artur Bykowski, and Christophe Rigotti. Approximation of frequency queries by means of free-sets. In PKDD 2000: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 75\u201385, London, UK, 2000. Springer-Verlag.","DOI":"10.1007\/3-540-45372-5_8"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/253260.253327","volume-title":"Proceedings of the 1997 ACM SIGMOD international conference on Management of Data (SIGMOD 1997)","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlation. In: Proceedings of the 1997 ACM SIGMOD international conference on Management of Data (SIGMOD 1997), May 1997, pp. 265\u2013276. ACM Press, New York (1997)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253260.253325","volume-title":"Proceedings of the 1997 ACM SIGMOD international conference on Management of Data (SIGMOD 1997)","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the 1997 ACM SIGMOD international conference on Management of Data (SIGMOD 1997), May 1997, pp. 255\u2013264. ACM Press, New York (1997)"},{"key":"10_CR14","volume-title":"Proc. of the 17th Int. Conf. on Data Engineering","author":"D. Burdick","year":"2001","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proc. of the 17th Int. Conf. on Data Engineering, IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/375551.375604","volume-title":"PODS 2001: Proceedings of the twentieth ACM SIGMODSIGACT- SIGART symposium on Principles of database systems","author":"A. Bykowski","year":"2001","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: PODS 2001: Proceedings of the twentieth ACM SIGMODSIGACT- SIGART symposium on Principles of database systems, pp. 267\u2013273. ACM Press, New York (2001)"},{"key":"10_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"issue":"1","key":"10_CR17","first-page":"60","volume":"6","author":"D. Cristofor","year":"2000","unstructured":"Cristofor, D., Cristofor, L., Simovici, D.A.: Galois Connections and Data Mining. Journal of Universal Computer Science\u00a06(1), 60\u201373 (2000)","journal-title":"Journal of Universal Computer Science"},{"issue":"95","key":"10_CR18","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"Duquenne, V., Guigues, J.-L.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines\u00a024(95), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"10_CR19","unstructured":"Fay, G.: An algorithm for finite Galois connections. Technical report, Institute for Industrial Economy, Budapest (1973)"},{"key":"10_CR20","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. FB4\u2013Preprint 831, TH Darmstadt (1984)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B. Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order\u00a08, 283\u2013290 (1991)","journal-title":"Order"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Goethals, B., Muhonen, J., Toivonen, H.: Mining non-derivable association rules. In: Proc. SIAM International Conference on Data Mining, Newport Beach, CA (April 2005)","DOI":"10.1137\/1.9781611972757.22"},{"key":"10_CR23","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, September 2000. Morgan Kaufmann, San Francisco (2000)"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Int\u2019l Conf. on Management of Data, May 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/ICDM.2002.1183905","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002)","author":"J. Han","year":"2002","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 211\u2013218. IEEE Computer Society, Los Alamitos (2002)"},{"key":"10_CR26","unstructured":"Kamber, M., Han, J., Chiang, Y.: Metarule-guided mining of multi-dimensional association rules using data cubes. In: Proc. of the 3rd KDD Int\u2019l Conf. (August 1997)"},{"key":"10_CR27","first-page":"305","volume-title":"ICDM 2001: Proceedings of the 2001 IEEE International","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunction-free generators. In: ICDM 2001: Proceedings of the 2001 IEEE International, Washington, DC, USA, pp. 305\u2013312. IEEE Computer Society, Los Alamitos (2001)"},{"key":"10_CR28","first-page":"227","volume-title":"Proceedings of the 3rd international conference on Knowledge Discovery and Data mining (KDD 1997)","author":"B. Lent","year":"1997","unstructured":"Lent, B., Agrawal, R., Srikant, R.: Discovering trends in text databases. In: Proceedings of the 3rd international conference on Knowledge Discovery and Data mining (KDD 1997), August 1997, pp. 227\u2013230. AAAI Press, Menlo Park (1997)"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BFb0100980","volume-title":"Advances in Database Technology - EDBT \u201998","author":"D. Lin","year":"1998","unstructured":"Lin, D., Kedem, M.: A new algorithm for discovering the maximum frequent set. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 105\u2013119. Springer, Heidelberg (1998)"},{"issue":"113","key":"10_CR30","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M.: Implications partielles dans un contexte. Math\u00e9matiques, Informatique et Sciences Humaines\u00a029(113), 35\u201355 (1991)","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"key":"10_CR31","unstructured":"Luxenburger, M.: Implikationen, Abh\u00e4ngigkeiten und Galois\u2013Abbildungen. PhD thesis, TH Darmstadt, Shaker Verlag, Aachen. In english language, beside the introduction (1993)"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","first-page":"41","volume-title":"Database Theory - ICDT \u201997","author":"H. Mannila","year":"1996","unstructured":"Mannila, H.: Methods and problems in data mining. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 41\u201355. Springer, Heidelberg (1996)"},{"issue":"2","key":"10_CR33","first-page":"243","volume":"23","author":"E.M. Norris","year":"1978","unstructured":"Norris, E.M.: An algorithm for computing the maximal rectangles in a binary relation. Rev. Roum. Math. Pures et Appl.\u00a023(2), 243\u2013250 (1978)","journal-title":"Rev. Roum. Math. Pures et Appl."},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/223784.223813","volume-title":"Proceedings of the 1995 ACM SIGMOD international conference on Management of Data (SIGMOD 1995)","author":"J.S. Park","year":"1995","unstructured":"Park, J.S., Chen, M.-S., Yu, P.S.: An efficient hash based algorithm for mining association rules. In: Proceedings of the 1995 ACM SIGMOD international conference on Management of Data (SIGMOD 1995), May 1995, pp. 175\u2013186. ACM Press, New York (1995)"},{"key":"10_CR35","unstructured":"Pasquier, N.: Extraction de bases pour les r\u00e8gles d\u2019association \u00e0 partir des itemsets ferm\u00e9s fr\u00e9quents. In: Actes du 18\u00e8me congr\u00e8s sur l\u2019Informatique des Organisations et Syst\u00e8mes d\u2019Information et de D\u00e9cision INFORSID 2000 (May 2000)"},{"key":"10_CR36","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Actes des 14\u00e8mes journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es (BDA 1998), Octobre 1998, pp. 177\u2013196 (1998)"},{"key":"10_CR37","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Actes des 15\u00e8mes journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es (BDA 1999), Octobre 1999, pp. 361\u2013381 (1999)"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"issue":"1","key":"10_CR39","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"issue":"1","key":"10_CR40","first-page":"29","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\u00a024(1), 29\u201360 (2005)","journal-title":"Journal of Intelligent"},{"key":"10_CR41","unstructured":"Pei, J., Han, J., Mao, R.: Closet: An efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"10_CR42","first-page":"432","volume-title":"Proceedings of the 21st international conference on Very Large Data Bases (VLDB 1995)","author":"E.O. Savasere","year":"1995","unstructured":"Savasere, E.O., Navathe, S.: An efficient algorithm for mining association rules in larges databases. In: Proceedings of the 21st international conference on Very Large Data Bases (VLDB 1995), September 1995, pp. 432\u2013444. Morgan Kaufmann, San Francisco (1995)"},{"issue":"1","key":"10_CR43","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1009713703947","volume":"2","author":"C. Silverstein","year":"1998","unstructured":"Silverstein, C., Brin, S., Motwani, R.: Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery\u00a02(1), 39\u201368 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR44","unstructured":"Stumme, G.: Conceptual knowledge discovery with frequent concept lattices. FB4- Preprint 2043, TU Darmstadt (1999)"},{"issue":"2","key":"10_CR45","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasqier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. J. on Knowledge and Data Engineering\u00a042(2), 189\u2013222 (2002)","journal-title":"J. on Knowledge and Data Engineering"},{"key":"10_CR46","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45422-5_24","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"G. Stumme","year":"2001","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol.\u00a02174, pp. 335\u2013350. Springer, Heidelberg (2001)"},{"key":"10_CR47","unstructured":"Taouil, R.: Algorithmique du treillis des ferm\u00e9s: application \u00e0 l\u2019analyse formelle de concepts et aux bases de donn\u00e9es. PhD thesis, Universit\u00e9 de Clermont-Ferrand II (2000)"},{"key":"10_CR48","unstructured":"Toivonen, H.: Discovery of frequent patterns in large data collection. PhD thesis, University of Helsinki (1996)"},{"key":"10_CR49","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-24651-0_30","volume-title":"Concept Lattices","author":"P. Valtchev","year":"2004","unstructured":"Valtchev, P., Missaoui, R., Godin, R.: Formal concept analysis for knowledge discovery and data mining: The new challenges. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 352\u2013371. Springer, Heidelberg (2004)"},{"key":"10_CR50","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/956750.956779","volume-title":"KDD 2003: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"J. Wang","year":"2003","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: KDD 2003: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 236\u2013245. ACM Press, New York (2003)"},{"key":"10_CR51","volume-title":"Proceedings of the Fourth SIAM International Conference on Data Mining","author":"J. Wang","year":"2004","unstructured":"Wang, J., Karypis, G.: Bamboo: Accelerating closed itemset mining by deeply pushing the length-decreasing support constraint. In: Berry, M.W., Dayal, U., Kamath, C., Skillicorn, D.B. (eds.) Proceedings of the Fourth SIAM International Conference on Data Mining, SIAM, Philadelphia (2004)"},{"key":"10_CR52","unstructured":"Zaki, M.J., Hsiao, C.-J.: Chaarm: An efficient algorithm for closed association rule mining. technical report 99\u201310. Technical report, Computer Science Dept., Rensselaer Polytechnic (October 1999)"},{"key":"10_CR53","first-page":"1","volume-title":"DMKD 1998 workshop on research issues in Data Mining and Knowledge Discovery","author":"M.J. Zaki","year":"1998","unstructured":"Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules. In: DMKD 1998 workshop on research issues in Data Mining and Knowledge Discovery, June 1998, pp. 1\u20138. ACM Press, New York (1998)"},{"key":"10_CR54","first-page":"283","volume-title":"Proceedings of the 3rd international conference on Knowledge Discovery and Data mining (KDD 1997)","author":"M.J. Zaki","year":"1997","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings of the 3rd international conference on Knowledge Discovery and Data mining (KDD 1997), August 1997, pp. 283\u2013286. AAAI Press, Menlo Park (1997)"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Mohammed, J.: Zaki. Generating non-redundant association rules. In: Proc. KDD 2000, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"issue":"4","key":"10_CR56","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsaio, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11528784_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:04:53Z","timestamp":1740539093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11528784_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278917","9783540318811"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/11528784_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}