乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:39:52Z","timestamp":1725838792154},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319270562"},{"type":"electronic","value":"9783319270579"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27057-9_11","type":"book-chapter","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T10:39:13Z","timestamp":1448361553000},"page":"151-164","source":"Crossref","is-referenced-by-count":4,"title":["Concept Discovery from Un-Constrained Distributed Context"],"prefix":"10.1007","author":[{"given":"Vishal","family":"Goel","sequence":"first","affiliation":[]},{"given":"B. D.","family":"Chaudhary","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,25]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","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, Berlin (1999)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-01815-2_23","volume-title":"Formal Concept Analysis","author":"R Wille","year":"2009","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS, vol. 5548, pp. 314\u2013339. Springer, Heidelberg (2009)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-03915-7_29","volume-title":"Advances in Intelligent Data Analysis VIII","author":"P Krajca","year":"2009","unstructured":"Krajca, P., Vychodil, V.: Distributed algorithm for computing formal concepts using map-reduce framework. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 333\u2013344. Springer, Heidelberg (2009)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-29892-9_26","volume-title":"Formal Concept Analysis","author":"B Xu","year":"2012","unstructured":"Xu, B., de Fr\u00e9in, R., Robson, E., \u00d3 Foghl\u00fa, M.: Distributed formal concept analysis algorithms based on an iterative mapreduce framework. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS, vol. 7278, pp. 292\u2013308. Springer, Heidelberg (2012)"},{"key":"11_CR5","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, pp. 10\u201310 (2010)"},{"key":"11_CR6","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, pp. 2\u20132. USENIX Association (2012)"},{"key":"11_CR7","unstructured":"Spark programming guide. \n http:\/\/Spark.apache.org\/docs\/latest\/programming-guide.html\n \n . Accessed 01 July 2015"},{"key":"11_CR8","unstructured":"UCI Machine Learning Repository: Data Sets. \n http:\/\/archive.ics.uci.edu\/ml\/datasets.html\n \n . Accessed: 01 July 2015"},{"key":"11_CR9","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. Inf. Syst. 24, 25\u201346 (1999)","journal-title":"Inf. Syst."},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.knosys.2005.11.017","volume":"19","author":"P Boucher-Ryan du","year":"2006","unstructured":"du Boucher-Ryan, P., Bridge, D.: Collaborative recommending using formal concept analysis. Knowl.-Based Syst. 19(5), 309\u2013315 (2006)","journal-title":"Knowl.-Based Syst."},{"key":"11_CR11","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2012","unstructured":"Rajaraman, A., Ullman, J.: Mining of Massive Datasets. Cambridge University Press, New York (2012)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Ying., W., Mingqing, X.: Diagnosis rule mining of airborne avionics using formal concept analysis. In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE (2013)","DOI":"10.1109\/CyberC.2013.51"},{"issue":"3","key":"11_CR13","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 8(3), 283\u2013290 (1991)","journal-title":"Order"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume-title":"Concept Lattices","author":"D Merwe van der","year":"2004","unstructured":"van der Merwe, D., Obiedkov, S., Kourie, D.G.: AddIntent: a new incremental algorithm for constructing concept lattices. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 372\u2013385. Springer, Heidelberg (2004)"},{"key":"11_CR15","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)"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27057-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T13:26:13Z","timestamp":1559309173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27057-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319270562","9783319270579"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27057-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}