{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T16:38:04Z","timestamp":1772815084363,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,7,27]],"date-time":"2014-07-27T00:00:00Z","timestamp":1406419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s13042-014-0288-3","type":"journal-article","created":{"date-parts":[[2014,7,26]],"date-time":"2014-07-26T11:52:23Z","timestamp":1406375543000},"page":"539-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Concept lattice compression in incomplete contexts based on K-medoids clustering"],"prefix":"10.1007","volume":"7","author":[{"given":"Caiping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhai","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,27]]},"reference":[{"key":"288_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R Wille","year":"1982","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel, Dordrecht, pp 445\u2013470"},{"key":"288_CR2","doi-asserted-by":"crossref","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 (1999) Formal concept analysis: mathematical foundations. Springer, New York"},{"key":"288_CR3","volume-title":"Uncertain decision making based on rough sets","author":"WX Zhang","year":"2005","unstructured":"Zhang WX, Qiu GF (2005) Uncertain decision making based on rough sets. Tsinghua University Press, Beijing"},{"key":"288_CR4","volume-title":"Rough set and concept lattice","author":"WX Zhang","year":"2006","unstructured":"Zhang WX, Yao YY, Leung Y (2006) Rough set and concept lattice. Xi\u2019an Jiaotong University Press, Xi\u2019an"},{"key":"288_CR5","volume-title":"Formal concept analysis, foundations and applications","author":"B Ganter","year":"2005","unstructured":"Ganter B, Stumme G, Wille R (2005) Formal concept analysis, foundations and applications. Springer, Berlin"},{"issue":"2","key":"288_CR6","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R Godin","year":"1995","unstructured":"Godin R (1995) Incremental concept formation algorithm based on Galois (concept) lattices. Comput Intell 11(2):246\u2013267","journal-title":"Comput Intell"},{"key":"288_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"SO Kuznetsov","year":"2002","unstructured":"Kuznetsov SO, Obiedkov SA (2002) Comparing performance of algorithms for generating concept lattices. J Exp Theor Artif Intell 14:189\u2013216","journal-title":"J Exp Theor Artif Intell"},{"key":"288_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Krajca","year":"2010","unstructured":"Krajca P, Outrata J, Vychodil V (2010) Parallel algorithm for computing fixpoints of Galois connections. Ann Math Artif Intel 59:257\u2013272","journal-title":"Ann Math Artif Intel"},{"issue":"2\u20133","key":"288_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/09528130210164161","volume":"14","author":"R Wille","year":"2002","unstructured":"Wille R (2002) Why can concept lattices support knowledge discovery in databases. J Exp Theor Artif Intell 14(2\u20133):81\u201392","journal-title":"J Exp Theor Artif Intell"},{"key":"288_CR10","doi-asserted-by":"crossref","unstructured":"Yao YY (2004) A comparative study of formal concept analysis and rough set theory in data analysis. In: Proceedings of 4th International Conference on rough sets and current trends in computing. Uppsala, Sweden, pp 59\u201368","DOI":"10.1007\/978-3-540-25929-9_6"},{"key":"288_CR11","doi-asserted-by":"crossref","first-page":"4125","DOI":"10.1016\/j.ins.2008.07.004","volume":"178","author":"LD Wang","year":"2008","unstructured":"Wang LD, Liu XD (2008) Concept analysis via rough set and AFS algebra. Inf Sci 178:4125\u20134137","journal-title":"Inf Sci"},{"key":"288_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s13042-013-0150-z","volume":"4","author":"JH Li","year":"2013","unstructured":"Li JH, Mei CL, Cherukuri AK, Zhang X (2013) On rule acquisition in decision formal contexts. Int J Mach Learn Cybern 4:721\u2013731","journal-title":"Int J Mach Learn Cybern"},{"key":"288_CR13","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1007\/s13042-012-0128-2","volume":"4","author":"MW Shao","year":"2013","unstructured":"Shao MW, Yang HZ (2013) Two kinds of multi-level formal concepts and its application for sets approximations. Int J Mach Learn Cybern 4:621\u2013630","journal-title":"Int J Mach Learn Cybern"},{"issue":"8","key":"288_CR14","first-page":"985","volume":"10","author":"C Carpineto","year":"2004","unstructured":"Carpineto C, Romano G (2004) Exploiting the potential of concept lattices for information retrieval with CREDO. J Univers Comput Sci 10(8):985\u20131013","journal-title":"J Univers Comput Sci"},{"issue":"2","key":"288_CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/227607.227613","volume":"5","author":"G Snelting","year":"1996","unstructured":"Snelting G (1996) Reengineering of configurations based on mathematical concept analysis. ACM Trans Softw Eng Methodol 5(2):146\u2013189","journal-title":"ACM Trans Softw Eng Methodol"},{"issue":"6","key":"288_CR16","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1360\/122004-104","volume":"48","author":"WX Zhang","year":"2005","unstructured":"Zhang WX, Wei L, Qi JJ (2005) Attribute reduction theory and approach to concept lattice. Sci China Ser F 48(6):713\u2013726","journal-title":"Sci China Ser F"},{"issue":"3","key":"288_CR17","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1016\/j.eswa.2009.09.026","volume":"37","author":"CH Aswani Kumar","year":"2010","unstructured":"Aswani Kumar CH, Srinivas S (2010) Concept lattice reduction using fuzzy K-means clustering. Expert Syst Appl 37(3):2696\u20132704","journal-title":"Expert Syst Appl"},{"key":"288_CR18","unstructured":"Dias SM, Vieira NJ (2010) Reducing the size of concept lattices: the JBOS approach. In: Proceedings of the Seventh International Conference on concept lattices and their applications, pp 80\u201391"},{"key":"288_CR19","doi-asserted-by":"crossref","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 et al (2002) Computing iceberg concept lattices with TITANIC. Data Knowl Eng 42:189\u2013222","journal-title":"Data Knowl Eng"},{"key":"288_CR20","volume-title":"The application of concept lattices to machine learning","author":"GD Oosthuizen","year":"1994","unstructured":"Oosthuizen GD (1994) The application of concept lattices to machine learning. University of Pretoria, South Africa"},{"key":"288_CR21","first-page":"15","volume":"111","author":"TJ Li","year":"2011","unstructured":"Li TJ, Wu WZ (2011) Attribute reduction in formal contexts: a covring rough set approach. Fund Inf 111:15\u201332","journal-title":"Fund Inf"},{"key":"288_CR22","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.knosys.2010.03.007","volume":"23","author":"JS Mi","year":"2010","unstructured":"Mi JS, Leung Y, Wu WZ (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl Based Syst 23:504\u2013511","journal-title":"Knowl Based Syst"},{"key":"288_CR23","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1016\/j.knosys.2010.07.001","volume":"23","author":"L Wei","year":"2010","unstructured":"Wei L, Qi JJ (2010) Relation between concept lattice reduction and rough set reduction. Knowl Based Syst 23:934\u2013938","journal-title":"Knowl Based Syst"},{"issue":"9","key":"288_CR24","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1016\/j.camwa.2006.03.040","volume":"53","author":"M Liu","year":"2007","unstructured":"Liu M, Shao MW, Zhang WX, Wu C (2007) Reduction method for concept lattices based on rough set theory and its application. Comput Math Appl 53(9):1390\u20131410","journal-title":"Comput Math Appl"},{"issue":"10","key":"288_CR25","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1109\/TKDE.2008.223","volume":"21","author":"WZ Wu","year":"2009","unstructured":"Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461\u20131474","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"288_CR26","doi-asserted-by":"crossref","unstructured":"Burmeister P, Holzer R (2000) On the treatment of incomplete knowledge in formal concept analysis. In: Conceptual structures: logical, linguistic, and computational issues. Springer, Berlin, Heidelberg, pp 385\u2013398","DOI":"10.1007\/10722280_27"},{"issue":"1","key":"288_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.ijar.2012.07.005","volume":"54","author":"JH Li","year":"2013","unstructured":"Li JH, Mei CL, Lv YJ (2013) Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction. Int J Approx Reason 54(1):149\u2013165","journal-title":"Int J Approx Reason"},{"issue":"1","key":"288_CR28","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S021848850200134X","volume":"10","author":"JY Liang","year":"2002","unstructured":"Liang JY, Xu ZB (2002) The algorithm on knowledge reduction in incompete information systems. Int J Uncertain Fuzz Knowl Based Syst 10(1):95\u2013103","journal-title":"Int J Uncertain Fuzz Knowl Based Syst"},{"key":"288_CR29","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1016\/j.knosys.2008.03.042","volume":"21","author":"LD Wang","year":"2008","unstructured":"Wang LD, Liu XD (2008) A new model of evaluating concept similarity. Knowl Based Syst 21:842\u2013846","journal-title":"Knowl Based Syst"},{"key":"288_CR30","doi-asserted-by":"crossref","unstructured":"Wang LD, Gong DX (2010) A structural information method for evaluating concept similarity. In: Seventh International Conference on fuzzy systems and knowledge discovery. IEEE press, pp 1966\u20131970","DOI":"10.1109\/FSKD.2010.5569473"},{"key":"288_CR31","unstructured":"Slowinski R, Vanderpooten D (1997) Similarity relation as a basis for rough approximations. ICS Research Report 53\/95, Warsaw University of Technology, Warsaw, 1995. In: Wang PP (ed) Advances in machine intelligence and soft-computing, vol IV. Duke University Press, Durham, pp 17\u201333"},{"issue":"4","key":"288_CR32","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.camwa.2010.12.060","volume":"61","author":"JH Li","year":"2011","unstructured":"Li JH, Mei CL, Lv YJ (2011) A heuristic knowledge-reduction method for decision formal contexts. Comput Math Appl 61(4):1096\u20131106","journal-title":"Comput Math Appl"},{"key":"288_CR33","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1016\/j.ins.2009.11.023","volume":"180","author":"YH Qian","year":"2010","unstructured":"Qian YH, Liang JY, Dang CY (2010) MGRS: a multi-granulation rough set. Inf Sci 180:949\u2013970","journal-title":"Inf Sci"},{"issue":"4","key":"288_CR34","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/34.993562","volume":"24","author":"DS Yeung","year":"2002","unstructured":"Yeung DS, Wang XZ (2002) Improving performance of similarity-based clustering by feature weight learning. IEEE Trans Pattern Anal 24(4):556\u2013561","journal-title":"IEEE Trans Pattern Anal"},{"issue":"10","key":"288_CR35","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1016\/j.patrec.2004.03.008","volume":"25","author":"XZ Wang","year":"2004","unstructured":"Wang XZ, Wang YD, Wang LJ (2004) Improving fuzzy c-means clustering based on feature-weight learning. Pattern Recogn Lett 25(10):1123\u20131132","journal-title":"Pattern Recogn Lett"},{"key":"288_CR36","volume-title":"Support vector machines-theory algorithm and expand","author":"NY Deng","year":"2009","unstructured":"Deng NY, Tian YJ (2009) Support vector machines-theory algorithm and expand. Science Press, Beijing"},{"issue":"2","key":"288_CR37","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s13042-012-0079-7","volume":"4","author":"T Hitendra Sarma","year":"2013","unstructured":"Hitendra Sarma T, Viswanath P, Eswara Reddy B (2013) A hybrid approach to speed-up the k-means clustering method. Int J Mach Learn Cybern 4(2):107\u2013117","journal-title":"Int J Mach Learn Cybern"},{"issue":"4","key":"288_CR38","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s13042-012-0103-y","volume":"4","author":"S Rana","year":"2013","unstructured":"Rana S, Jasola S, Kumar R (2013) A boundary restricted adaptive particle swarm optimization for data clustering. Int J Mach Learn Cybern 4(4):391\u2013400","journal-title":"Int J Mach Learn Cybern"},{"key":"288_CR39","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on discrete algorithms, society for industrial and applied mathematics, Philadelphia, pp 1027\u20131035"},{"key":"288_CR40","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"issue":"2","key":"288_CR41","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park HS, Jun CH (2009) A simple and fast algorithm for K-medoids clustering. Expert Syst Appl 36(2):3336\u20133341","journal-title":"Expert Syst Appl"},{"key":"288_CR42","volume-title":"Research on reduction theory and approaches to concept lattices","author":"X Wang","year":"2008","unstructured":"Wang X (2008) Research on reduction theory and approaches to concept lattices. Xi\u2019an Jiaotong University Press, Xi\u2019an"},{"key":"288_CR43","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository. University of California, School of Information and Computer Science, Irvine. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"3","key":"288_CR44","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"JC Dunn","year":"1973","unstructured":"Dunn JC (1973) A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J Cybern 3(3):32\u201357","journal-title":"J Cybern"},{"issue":"5","key":"288_CR45","first-page":"886","volume":"33","author":"Y Wen","year":"2013","unstructured":"Wen Y, Xiao MQ, Wang YD, Qu DP (2013) Diagnostic rule acquisition from incomplete information based on concept lattices. J Vib Meas Diagn 33(5):886\u2013891 (in Chinese)","journal-title":"J Vib Meas Diagn"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0288-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0288-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0288-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T14:31:16Z","timestamp":1559485876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0288-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,27]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["288"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0288-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,27]]}}}