{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:56:00Z","timestamp":1726059360881},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_6","type":"book-chapter","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:30:38Z","timestamp":1573864238000},"page":"79-94","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unsupervised Feature Selection for Noisy Data"],"prefix":"10.1007","author":[{"given":"Kaveh","family":"Mahdavi","sequence":"first","affiliation":[]},{"given":"Jesus","family":"Labarta","sequence":"additional","affiliation":[]},{"given":"Judit","family":"Gimenez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"unstructured":"Arai, K., Barakbah A. R.: Hierarchical K-means: an algorithm for centroids initialization for K-means. Reports of the Faculty of Science, Saga University, 36(1), pp. 25\u201331 (2007)","key":"6_CR1"},{"doi-asserted-by":"publisher","unstructured":"Cai, D., Zhang, C., He, X.: Unsupervised feature selection for multi-cluster data. In: Proceedings of the 16th ACM SIGKDD (2010). \nhttps:\/\/doi.org\/10.1145\/1835804.1835848","key":"6_CR2","DOI":"10.1145\/1835804.1835848"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"Thomas M. Cover","year":"2005","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn., p. 394. Wiley-Interscience (2005). \nhttps:\/\/doi.org\/10.1002\/047174882x"},{"unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn., pp. 400\u2013401. Wiley-Interscience, Hoboken (2000)","key":"6_CR4"},{"key":"6_CR5","first-page":"845","volume":"5","author":"JG Dy","year":"2004","unstructured":"Dy, J.G., Brodley, C.: Feature selection for unsupervised learning. JMLR 5, 845\u2013889 (2004)","journal-title":"JMLR"},{"key":"6_CR6","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. JMLR 3, 1157\u20131182 (2003)","journal-title":"JMLR"},{"unstructured":"He, X., Cai, D., Niyogi, P.: Laplacian score for feature selection. In: Advances in Neural Information Processing System, vol. 18, pp. 507\u2013514 (2005)","key":"6_CR7"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/j.2044-8317.1964.tb00244.x","volume":"17","author":"AE Hendrickson","year":"1964","unstructured":"Hendrickson, A.E., White, P.O.: PROMAX: a quick method for rotation to oblique simple structure. J. Stat. Psychol. 17(1), 65\u201370 (1964). \nhttps:\/\/doi.org\/10.1111\/j.2044-8317.1964.tb00244.x","journal-title":"J. Stat. Psychol."},{"issue":"4\u20135","key":"6_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0893-6080(00)00026-5","volume":"13","author":"A Hyvrinen","year":"2000","unstructured":"Hyvrinen, A., Oja, E.: Independent component analysis: algorithms and applications. Neural Netw. 13(4\u20135), 411\u2013430 (2000)","journal-title":"Neural Netw."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/bf02289233","volume":"23","author":"HF Kaiser","year":"1958","unstructured":"Kaiser, H.F.: The varimax criterion for analytic rotation in factor analysis. Psychometrika 23(3), 187\u2013200 (1958). \nhttps:\/\/doi.org\/10.1007\/bf02289233","journal-title":"Psychometrika"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/tkde.2005.66","volume":"17","author":"H Liu","year":"2005","unstructured":"Liu, H., Yu, L.: Toward integrating feature selection algorithms for classification and clustering. IEEE Trans. Knowl. Data Eng. 17(4), 491\u2013502 (2005). \nhttps:\/\/doi.org\/10.1109\/tkde.2005.66","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"publisher","unstructured":"Lu, Y., Cohen, I., Zhou, X.S., Tian, Q.: Feature selection using principal feature analysis. In: Proceedings of the 15th ACM International Conference on Multimedia, pp. 301\u2013304 (2007). \nhttps:\/\/doi.org\/10.1145\/1291233.1291297","key":"6_CR12","DOI":"10.1145\/1291233.1291297"},{"doi-asserted-by":"publisher","unstructured":"Mancini, R., Carter, B.: Op Amps for Everyone. Texas Instruments, pp. 10\u201311 (2009). \nhttps:\/\/doi.org\/10.1016\/b978-1-85617-505-0.x0001-4","key":"6_CR13","DOI":"10.1016\/b978-1-85617-505-0.x0001-4"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/00401706.1984.10487939","volume":"26","author":"GP McCabe","year":"1984","unstructured":"McCabe, G.P.: Principal variables. Technometrics 26(2), 137\u2013144 (1984)","journal-title":"Technometrics"},{"unstructured":"Qian, M., Zhai, C.: Robust unsupervised feature selection. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 1621\u20131627 (2013)","key":"6_CR15"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/2685263","volume":"42","author":"JL Rodgers","year":"1988","unstructured":"Rodgers, J.L., Nicewander, W.A.: Thirteen ways to look at the correlation coefficient. Am. Stat. 42(1), 59\u201366 (1988). \nhttps:\/\/doi.org\/10.2307\/2685263","journal-title":"Am. Stat."},{"unstructured":"Shlens, J.: A tutorial on principal component analysis. ArXiv preprint \narXiv:1404.2986\n\n (2014)","key":"6_CR17"},{"issue":"12","key":"6_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.5120\/16645-6617","volume":"95","author":"H Shukla","year":"2014","unstructured":"Shukla, H., Kumar, N., Tripathi, R.P.: Gaussian noise filtering techniques using new median filter. IJCA 95(12), 12\u201315 (2014). \nhttps:\/\/doi.org\/10.5120\/16645-6617","journal-title":"IJCA"},{"unstructured":"Zarzoso, V., Comon, P., Kallel, M.: How fast is FastICA? In: Proceedings of the 14th European Signal Processing Conference, pp. 1\u20135 (2006)","key":"6_CR19"},{"doi-asserted-by":"publisher","unstructured":"Zhao, Z., Liu, H.: Spectral feature selection for supervised and unsupervised learning. In: Proceedings of the 24th ICML, pp. 1151\u20131157 (2007). \nhttps:\/\/doi.org\/10.1145\/1273496.1273641","key":"6_CR20","DOI":"10.1145\/1273496.1273641"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:32:07Z","timestamp":1573864327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}