{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:13:56Z","timestamp":1763705636950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260743"},{"type":"electronic","value":"9783030260750"}],"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-26075-0_8","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T19:05:48Z","timestamp":1563995148000},"page":"103-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["I-mRMR: Incremental Max-Relevance, and Min-Redundancy Feature Selection"],"prefix":"10.1007","author":[{"given":"Yeliang","family":"Xiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suyun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/72.298224","volume":"5","author":"R Battiti","year":"1994","unstructured":"Battiti, R.: Using mutual information for selecting features in supervised neural net learning. IEEE Trans. Neural Netw. 5(4), 537\u2013550 (1994)","journal-title":"IEEE Trans. Neural Netw."},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.11.024","volume-title":"A Survey on Feature Selection Methods","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar, G., Sahin, F.: A Survey on Feature Selection Methods. Pergamon Press, Inc., Oxford (2014)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TNN.2008.2005601","volume":"20","author":"PA Est\u00e9vez","year":"2009","unstructured":"Est\u00e9vez, P.A., Tesmer, M., Perez, C.A., Zurada, J.M.: Normalized mutual information feature selection. IEEE Trans. Neural Netw. 20(2), 189\u2013201 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"6","key":"8_CR4","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A., Kaelbling, L.P.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3(6), 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/72.977291","volume":"13","author":"N Kwak","year":"2002","unstructured":"Kwak, N., Choi, C.H.: Input feature selection for classification problems. IEEE Trans. Neural Netw. 13(1), 143 (2002)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008363719778","volume":"9","author":"H Liu","year":"1998","unstructured":"Liu, H., Setiono, R.: Incremental feature selection. Appl. Intell. 9(3), 217\u2013230 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1008363719778","journal-title":"Appl. Intell."},{"issue":"8","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng, H., Long, F., Ding, C.: Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans. Pattern Anal. Mach. Intell. 27(8), 1226\u20131238 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.chemolab.2005.06.010","volume":"80","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Lendasse, A., Fran\u00e7ois, D., Wertz, V., Verleysen, M.: Mutual information for the selection of relevant variables in spectrometric nonlinear modelling. Chemom. Intell. Lab. Syst. 80(2), 215\u2013226 (2006)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"8_CR9","volume-title":"Elements of Information Theory","author":"DL Schilling","year":"2003","unstructured":"Schilling, D.L.: Elements of Information Theory. Wiley, Hoboken (2003)"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3390\/e19040157","volume":"19","author":"D Sluga","year":"2017","unstructured":"Sluga, D., Lotri\u010d, U.: Quadratic mutual information feature selection. Entropy 19(4), 157 (2017)","journal-title":"Entropy"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00521-013-1368-0","volume":"24","author":"JR Vergara","year":"2014","unstructured":"Vergara, J.R., Est\u00e9vez, P.A.: A review of feature selection methods based on mutual information. Neural Comput. Appl. 24(1), 175\u2013186 (2014)","journal-title":"Neural Comput. Appl."},{"issue":"99","key":"8_CR12","first-page":"1","volume":"PP","author":"J Xu","year":"2018","unstructured":"Xu, J., Xu, C., Zou, B., Tang, Y.Y., Peng, J., You, X.: New incremental learning algorithm with support vector machines. IEEE Trans. Syst. Man Cybern. Syst. PP(99), 1\u201312 (2018)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"9","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1109\/TKDE.2005.148","volume":"17","author":"J Ye","year":"2005","unstructured":"Ye, J., Li, Q., Xiong, H., Park, H., Janardan, R., Kumar, V.: IDR\/QR: an incremental dimension reduction algorithm via QR decomposition. IEEE Trans. Knowl. Data Eng. 17(9), 1208\u20131222 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-24471-1_17","volume-title":"Similarity-Based Pattern Recognition","author":"Z Zhang","year":"2011","unstructured":"Zhang, Z., Hancock, E.R.: Mutual information criteria for feature selection. In: Pelillo, M., Hancock, E.R. (eds.) SIMBAD 2011. LNCS, vol. 7005, pp. 235\u2013249. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24471-1_17"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26075-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T07:03:33Z","timestamp":1574060613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26075-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260743","9783030260750"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26075-0_8","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":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"42","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":"17","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}