{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T11:13:36Z","timestamp":1782386016427,"version":"3.54.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evolving Systems"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12530-018-9235-y","type":"journal-article","created":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T09:00:22Z","timestamp":1527066022000},"page":"453-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Self-supervised autoencoders for clustering and classification"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3087-3174","authenticated-orcid":false,"given":"Paraskevi","family":"Nousi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anastasios","family":"Tefas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"key":"9235_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional spaces. In: ICDT, vol 1. Springer, pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"9235_CR2","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, pp 1027\u20131035"},{"issue":"7","key":"9235_CR3","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/34.598228","volume":"19","author":"PN Belhumeur","year":"1997","unstructured":"Belhumeur PN, Hespanha JP, Kriegman DJ (1997) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19(7):711\u2013720","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9235_CR4","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? In: International conference on database theory. Springer, pp 217\u2013235"},{"issue":"2\u20133","key":"9235_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek JC, Ehrlich R, Full W (1984) Fcm: the fuzzy c-means clustering algorithm. Comput Geosci 10(2\u20133):191\u2013203","journal-title":"Comput Geosci"},{"key":"9235_CR6","first-page":"51","volume":"28","author":"AA Bhuiyan","year":"2007","unstructured":"Bhuiyan AA, Liu CH (2007) On face recognition using gabor filters. World Acad Sci Eng Technol 28:51\u201356","journal-title":"World Acad Sci Eng Technol"},{"issue":"2","key":"9235_CR7","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TIT.2014.2375327","volume":"61","author":"C Boutsidis","year":"2015","unstructured":"Boutsidis C, Zouzias A, Mahoney MW, Drineas P (2015) Randomized dimensionality reduction for $$k$$-means clustering. IEEE Trans Inf Theory 61(2):1045\u20131062","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"9235_CR8","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/TNNLS.2014.2329240","volume":"26","author":"D Bouzas","year":"2015","unstructured":"Bouzas D, Arvanitopoulos N, Tefas A (2015) Graph embedded nonparametric mutual information for supervised dimensionality reduction. IEEE Trans Neural Netw Learn Syst 26(5):951\u2013963","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"9235_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst Appl 40(1):200\u2013210","journal-title":"Expert Syst Appl"},{"key":"9235_CR10","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2015.05.026","volume":"34","author":"C Chrysouli","year":"2015","unstructured":"Chrysouli C, Tefas A (2015) Spectral clustering and semi-supervised learning using evolving similarity graphs. Appl Soft Comput 34:625\u2013637","journal-title":"Appl Soft Comput"},{"key":"9235_CR11","doi-asserted-by":"crossref","unstructured":"Davis JV, Kulis B, Jain P, Sra S, Dhillon IS (2007) Information-theoretic metric learning. In: Proceedings of the 24th international conference on Machine learning. ACM, pp 209\u2013216","DOI":"10.1145\/1273496.1273523"},{"key":"9235_CR12","doi-asserted-by":"crossref","unstructured":"Dehghan A, Ortiz EG, Villegas R, Shah M (2014) Who do i look like? Determining parent-offspring resemblance via gated autoencoders. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 1757\u20131764","DOI":"10.1109\/CVPR.2014.227"},{"key":"9235_CR13","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 551\u2013556","DOI":"10.1145\/1014052.1014118"},{"key":"9235_CR14","doi-asserted-by":"crossref","unstructured":"Ding C, He X (2004) K-means clustering via principal component analysis. In: Proceedings of the twenty-first international conference on Machine learning. ACM, p 29","DOI":"10.1145\/1015330.1015408"},{"key":"9235_CR15","doi-asserted-by":"crossref","unstructured":"Ding C, Li T (2007) Adaptive dimension reduction using discriminant analysis and k-means clustering. In: Proceedings of the 24th international conference on Machine learning. ACM, pp 521\u2013528","DOI":"10.1145\/1273496.1273562"},{"issue":"2","key":"9235_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"1936","unstructured":"Fisher RA (1936) The use of multiple measurements in taxonomic problems. Ann Eugen 7(2):179\u2013188","journal-title":"Ann Eugen"},{"key":"9235_CR17","doi-asserted-by":"crossref","unstructured":"Ghosh S, Dubey SK (2013) Comparative analysis of k-means and fuzzy c-means algorithms. Int J Adv Comput Sci Appl 4(4)","DOI":"10.14569\/IJACSA.2013.040406"},{"key":"9235_CR18","unstructured":"Guo G, Li SZ, Chan K (2000) Face recognition by support vector machines. In: Fourth IEEE International Conference on Automatic Face and Gesture Recognition, 2000. Proceedings, pp 196\u2013201. IEEE"},{"key":"9235_CR19","unstructured":"Howard AG, Zhu M, Chen B, Kalenichenko D, Wang W, Weyand T, Andreetto M, Adam H (2017) Mobilenets: efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861"},{"key":"9235_CR20","doi-asserted-by":"crossref","unstructured":"Huang P, Huang Y, Wang W, Wang L (2014) Deep embedding network for clustering. In: 2014 22nd International Conference on Pattern Recognition (ICPR). IEEE, pp 1532\u20131537","DOI":"10.1109\/ICPR.2014.272"},{"issue":"3","key":"9235_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min Knowl Disc 2(3):283\u2013304","journal-title":"Data Min Knowl Disc"},{"issue":"8","key":"9235_CR22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"key":"9235_CR23","unstructured":"Jolliffe I (2002) Principal component analysis. Wiley Online Library"},{"issue":"11","key":"9235_CR24","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"Khan SS, Ahmad A (2004) Cluster center initialization algorithm for k-means clustering. Pattern Recogn Lett 25(11):1293\u20131302","journal-title":"Pattern Recogn Lett"},{"key":"9235_CR25","unstructured":"Kingma D, Ba J (2014) Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"9235_CR26","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. In: Advances in neural information processing systems, pp 1097\u20131105"},{"issue":"1\u20132","key":"9235_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. NRL 2(1\u20132):83\u201397","journal-title":"NRL"},{"key":"9235_CR28","unstructured":"Le QV (2013) Building high-level features using large scale unsupervised learning. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, pp 8595\u20138598"},{"issue":"11","key":"9235_CR29","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proc IEEE 86(11):2278\u20132324","journal-title":"Proc IEEE"},{"issue":"5","key":"9235_CR30","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","volume":"27","author":"KC Lee","year":"2005","unstructured":"Lee KC, Ho J, Kriegman DJ (2005) Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans Pattern Anal Mach Intell 27(5):684\u2013698","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"9235_CR31","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas A, Vlassis N, Verbeek JJ (2003) The global k-means clustering algorithm. Pattern Recogn 36(2):451\u2013461","journal-title":"Pattern Recogn"},{"key":"9235_CR32","unstructured":"MacQueen J et al (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1. Oakland, CA, USA, pp 281\u2013297"},{"key":"9235_CR33","doi-asserted-by":"crossref","unstructured":"Mika S, Ratsch G, Weston J, Scholkopf B, Mullers KR (1999) Fisher discriminant analysis with kernels. In: Neural Networks for Signal Processing IX, 1999. Proceedings of the 1999 IEEE Signal Processing Society Workshop., pp 41\u201348. IEEE","DOI":"10.1109\/NNSP.1999.788121"},{"key":"9235_CR34","unstructured":"Nene SA, Nayar SK, Murase H et\u00a0al (1996) Columbia object image library (coil-20)"},{"issue":"10","key":"9235_CR35","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIP.2014.2348868","volume":"23","author":"S Nikitidis","year":"2014","unstructured":"Nikitidis S, Tefas A, Pitas I (2014) Maximum margin projection subspace learning for visual data analysis. IEEE Trans Image Process 23(10):4413\u20134425","journal-title":"IEEE Trans Image Process"},{"key":"9235_CR36","doi-asserted-by":"crossref","unstructured":"Nousi P, Tefas A (2017) Deep learning algorithms for discriminant autoencoding. Neurocomputing","DOI":"10.1016\/j.neucom.2017.05.042"},{"key":"9235_CR37","doi-asserted-by":"crossref","unstructured":"Nousi P, Tefas A (2017) Discriminatively trained autoencoders for fast and accurate face recognition. In: International Conference on Engineering Applications of Neural Networks. Springer, pp 205\u2013215","DOI":"10.1007\/978-3-319-65172-9_18"},{"key":"9235_CR38","unstructured":"Passalis N, Tefas A (2016) Information clustering using manifold-based optimization of the bag-of-features representation. IEEE Trans Cybern"},{"key":"9235_CR39","unstructured":"Passalis N, Tefas A (2017) Dimensionality reduction using similarity-induced embeddings. IEEE Trans Neural Netw Learn Syst"},{"key":"9235_CR40","unstructured":"Rolfe JT, LeCun Y (2013) Discriminative recurrent sparse auto-encoders. arXiv preprint arXiv:1301.3775"},{"key":"9235_CR41","doi-asserted-by":"crossref","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1985) Learning internal representations by error propagation. Tech. rep, DTIC Document","DOI":"10.21236\/ADA164453"},{"key":"9235_CR42","unstructured":"Samaria FS, Harter AC (1994) Parameterisation of a stochastic model for human face identification. In: Proceedings of the Second IEEE Workshop on Applications of Computer Vision. IEEE, pp 138\u2013142"},{"key":"9235_CR43","doi-asserted-by":"crossref","unstructured":"Schroff F, Kalenichenko D, Philbin J (2015) Facenet: a unified embedding for face recognition and clustering. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 815\u2013823","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"9235_CR44","doi-asserted-by":"crossref","unstructured":"Song C, Liu F, Huang Y, Wang L, Tan T (2013) Auto-encoder based data clustering. In: Iberoamerican Congress on Pattern Recognition. Springer, pp 117\u2013124","DOI":"10.1007\/978-3-642-41822-8_15"},{"issue":"1","key":"9235_CR45","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava N, Hinton GE, Krizhevsky A, Sutskever I, Salakhutdinov R (2014) Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res 15(1):1929\u20131958","journal-title":"J Mach Learn Res"},{"key":"9235_CR46","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617"},{"key":"9235_CR47","doi-asserted-by":"crossref","unstructured":"Tian F, Gao B, Cui Q, Chen E, Liu TY (2014) Learning deep representations for graph clustering. In: AAAI, pp 1293\u20131299","DOI":"10.1609\/aaai.v28i1.8916"},{"issue":"8","key":"9235_CR48","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.patcog.2015.02.020","volume":"48","author":"N Tsapanos","year":"2015","unstructured":"Tsapanos N, Tefas A, Nikolaidis N, Pitas I (2015) A distributed framework for trimmed kernel k-means clustering. Pattern Recogn 48(8):2685\u20132698","journal-title":"Pattern Recogn"},{"key":"9235_CR49","doi-asserted-by":"crossref","unstructured":"Vincent P, Larochelle H, Bengio Y, Manzagol PA (2008) Extracting and composing robust features with denoising autoencoders. In: Proceedings of the 25th international conference on Machine learning. ACM, pp 1096\u20131103","DOI":"10.1145\/1390156.1390294"},{"key":"9235_CR50","doi-asserted-by":"crossref","unstructured":"Wang J, Wang J, Ke Q, Zeng G, Li S (2015) Fast approximate k-means via cluster closures. In: Multimedia Data Mining and Analytics. Springer, pp 373\u2013395","DOI":"10.1007\/978-3-319-14998-1_17"},{"key":"9235_CR51","unstructured":"Xie J, Girshick R, Farhadi A (2016) Unsupervised deep embedding for clustering analysis. In: International Conference on Machine Learning, pp 478\u2013487"},{"key":"9235_CR52","unstructured":"Xing EP, Jordan MI, Russell SJ, Ng AY (2003) Distance metric learning with application to clustering with side-information. In: Advances in neural information processing systems, pp 521\u2013528"},{"key":"9235_CR53","doi-asserted-by":"crossref","unstructured":"Yang J, Parikh D, Batra D (2016) Joint unsupervised learning of deep representations and image clusters. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 5147\u20135156","DOI":"10.1109\/CVPR.2016.556"},{"key":"9235_CR54","doi-asserted-by":"crossref","unstructured":"Zhang T (2004) Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: Proceedings of the twenty-first international conference on Machine learning. ACM, p 116","DOI":"10.1145\/1015330.1015332"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-018-9235-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12530-018-9235-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-018-9235-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T18:13:40Z","timestamp":1751652820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12530-018-9235-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["9235"],"URL":"https:\/\/doi.org\/10.1007\/s12530-018-9235-y","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"value":"1868-6478","type":"print"},{"value":"1868-6486","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"4 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}