{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:57Z","timestamp":1740099057475,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319913780"},{"type":"electronic","value":"9783319913797"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91379-7_3","type":"book-chapter","created":{"date-parts":[[2018,5,19]],"date-time":"2018-05-19T12:04:11Z","timestamp":1526731451000},"page":"24-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Approximation of Concept Stability Using Low-Discrepancy Sampling"],"prefix":"10.1007","author":[{"given":"Mohamed-Hamza","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rokia","family":"Missaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,20]]},"reference":[{"key":"3_CR1","unstructured":"Alpen, \u00c9.: Pr\u00e9cis de Phytot\u00e9rapie. \u00c9dition Alpen (2010). \nwww.alpen.mc\/precis-de-phytotherapie"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-29892-9_7","volume-title":"Formal Concept Analysis","author":"MA Babin","year":"2012","unstructured":"Babin, M.A., Kuznetsov, S.O.: Approximating concept stability. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 7\u201315. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29892-9_7"},{"key":"3_CR3","unstructured":"Bache, K., Lichman, M.: Mushroom data set (2013). \nhttp:\/\/archive.ics.uci.edu\/ml"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-20514-9_7","volume-title":"Formal Concept Analysis","author":"R Belohlavek","year":"2011","unstructured":"Belohlavek, R., Macko, J.: Selecting important concepts using weights. In: Valtchev, P., J\u00e4schke, R. (eds.) ICFCA 2011. LNCS (LNAI), vol. 6628, pp. 65\u201380. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20514-9_7"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.procs.2014.05.344","volume":"31","author":"A Buzmakov","year":"2014","unstructured":"Buzmakov, A., Kuznetsov, S.O., Napoli, A.: Is concept stability a measure for pattern selection? Procedia Comput. Sci. 31, 918\u2013927 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-07248-7_12","volume-title":"Formal Concept Analysis","author":"A Buzmakov","year":"2014","unstructured":"Buzmakov, A., Kuznetsov, S.O., Napoli, A.: Scalable estimates of concept stability. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) ICFCA 2014. LNCS (LNAI), vol. 8478, pp. 157\u2013172. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07248-7_12"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002804","volume":"7","author":"RE Caflisch","year":"1998","unstructured":"Caflisch, R.E.: Monte Carlo and quasi-Monte Carlo methods. Acta Numer. 7, 1\u201349 (1998)","journal-title":"Acta Numer."},{"key":"3_CR8","unstructured":"Davis, A., Gardner, B., Gardner, M.: Deep South (1941). \nhttp:\/\/networkdata.ics.uci.edu\/netdata\/html\/davis.html"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-56046-0_16","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods 2000","author":"H Faure","year":"2002","unstructured":"Faure, H., Tezuka, S.: Another random scrambling of digital (t, s)-sequences. In: Fang, K.T., Niederreiter, H., Hickernell, F.J. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 242\u2013256. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/978-3-642-56046-0_16"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-642-59830-2\n\n. Translator C. Franzke"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-11928-6_18","volume-title":"Formal Concept Analysis","author":"M Klimushkin","year":"2010","unstructured":"Klimushkin, M., Obiedkov, S., Roth, C.: Approaches to the selection of relevant concepts in the case of noisy data. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 255\u2013266. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-11928-6_18"},{"key":"3_CR12","unstructured":"Kuipers, L., Niederreiter, H.: Uniform distribution of sequences. Courier Corporation (2012)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-73681-3_18","volume-title":"Conceptual Structures: Knowledge Architectures for Smart Applications","author":"S Kuznetsov","year":"2007","unstructured":"Kuznetsov, S., Obiedkov, S., Roth, C.: Reducing the representation complexity of lattice-based taxonomies. In: Priss, U., Polovina, S., Hill, R. (eds.) ICCS-ConceptStruct 2007. LNCS (LNAI), vol. 4604, pp. 241\u2013254. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73681-3_18"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"SO Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.O.: Learning of simple conceptual graphs from positive and negative examples. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 384\u2013391. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-540-48247-5_47"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10472-007-9053-6","volume":"49","author":"SO Kuznetsov","year":"2007","unstructured":"Kuznetsov, S.O.: On stability of a formal concept. Ann. Math. Artif. Intell. 49(1), 101\u2013115 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR16","unstructured":"Kuznetsov, S.O., Makhalova, T.P.: Concept interestingness measures: a comparative study. In: Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, France, 13\u201316 October 2015, pp. 59\u201372 (2015)"},{"key":"3_CR17","unstructured":"Kuznetsov, S.O., Makhalova, T.P.: On interestingness measures of formal concepts. CoRR abs\/1611.02646 (2016)"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139696463","volume-title":"A Guide to Monte Carlo Simulations in Statistical Physics","author":"DP Landau","year":"2014","unstructured":"Landau, D.P., Binder, K.: A Guide to Monte Carlo Simulations in Statistical Physics. Cambridge University Press, Cambridge (2014)"},{"key":"3_CR19","unstructured":"Lemieux, C.: Monte Carlo and quasi-Monte Carlo sampling (2009)"},{"issue":"11","key":"3_CR20","first-page":"507","volume":"8","author":"J Muangprathub","year":"2014","unstructured":"Muangprathub, J.: A novel algorithm for building concept lattice. Appl. Math. Sci. 8(11), 507\u2013515 (2014)","journal-title":"Appl. Math. Sci."},{"key":"3_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Monte Carlo extension of quasi-Monte Carlo. In: Simulation Conference Proceedings Winter, vol. 1, pp. 571\u2013577. IEEE (1998)","DOI":"10.1109\/WSC.1998.745036"},{"issue":"02","key":"3_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0129054108005735","volume":"19","author":"C Roth","year":"2008","unstructured":"Roth, C., Obiedkov, S., Kourie, D.G.: On succinct representation of knowledge community taxonomies with formal concept analysis. Int. J. Found. Comput. Sci. 19(02), 383\u2013404 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-33507-0_28","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"C Schretter","year":"2016","unstructured":"Schretter, C., He, Z., Gerber, M., Chopin, N., Niederreiter, H.: Van der corput and golden ratio sequences along the hilbert space-filling curve. In: Cools, R., Nuyens, D. (eds.) Monte Carlo and Quasi-Monte Carlo Methods, vol. 163, pp. 531\u2013544. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33507-0_28"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/917639","volume":"2014","author":"HL Zhi","year":"2014","unstructured":"Zhi, H.L.: On the calculation of formal concept stability. J. Appl. Math. 2014, 1\u20136 (2014)","journal-title":"J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91379-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,19]],"date-time":"2018-05-19T12:05:09Z","timestamp":1526731509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91379-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319913780","9783319913797"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91379-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}