{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/fast-forward-feature-selection-for-the","title":"Fast forward feature selection for the nonlinear classification of hyperspectral images","arxiv_id":"1501.00857","date":"2015-01-05","proceeding":null,"authors":["Mathieu Fauvel","Clement Dechesne","Anthony Zullo","Frédéric Ferraty"],"abstract":"A fast forward feature selection algorithm is presented in this paper. It is\nbased on a Gaussian mixture model (GMM) classifier. GMM are used for\nclassifying hyperspectral images. The algorithm selects iteratively spectral\nfeatures that maximizes an estimation of the classification rate. The\nestimation is done using the k-fold cross validation. In order to perform fast\nin terms of computing time, an efficient implementation is proposed. First, the\nGMM can be updated when the estimation of the classification rate is computed,\nrather than re-estimate the full model. Secondly, using marginalization of the\nGMM, sub models can be directly obtained from the full model learned with all\nthe spectral features. Experimental results for two real hyperspectral data\nsets show that the method performs very well in terms of classification\naccuracy and processing time. Furthermore, the extracted model contains very\nfew spectral channels.","url_abs":"http://arxiv.org/abs/1501.00857v1","url_pdf":"http://arxiv.org/pdf/1501.00857v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fast-forward-feature-selection-for-the","repo_url":"https://github.com/mfauvel/FFFS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"hyperspectral-image-classification","task_name":"Hyperspectral Image Classification"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"mfauvel/FFFS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bda07e173f1faf0fdb35feb92f2d9997b6f12e4865c40f1cddb43b2355bfbbcc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}