{"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/sparse-bayesian-approach-for-metric-learning","title":"Sparse Bayesian approach for metric learning in latent space","arxiv_id":null,"date":"2019-08-15","proceeding":"Knowledge-Based Systems 2019 8","authors":["Davood Zabihzadeh","Reza Monsefi","Hadi Sadoghi Yazdi"],"abstract":"This paper presents a new and efficient approach for metric learning in latent space. Our method\r\ndiscovers an optimal mapping from the feature space to a latent space that shrinks the distance\r\nbetween similar data items and also increases the distance between dissimilar ones. The proposed\r\napproach is based on a Bayesian variational framework which iteratively finds the optimal posterior\r\ndistribution of parameters and hyperparameters of the model. Advantages of the proposed method to\r\nsimilar work are 1) Learning the noise of the latent variables on the low-dimensional manifold to find a\r\nmore effective transformation. 2) Automatically finding the dimension of latent space and sparsification\r\nof the solution which prevents the overfitting problem. 3) Unlike Mahalanobis metric learning, the\r\nproposed algorithm roughly scales linearly to the dimension of data. Also, the present work is extended\r\nfor learning in the feature space induced by an RKHS kernel. The proposed method is evaluated on\r\nsmall and large datasets coming from real applications such as network intrusion detection, face\r\nrecognition, handwritten digits, letter recognition, and hyperspectral image classification. The results\r\nshow that our method outperforms related representative and state-of-the-art methods in many small\r\nand large datasets.","url_abs":"https://www.sciencedirect.com/science/article/abs/pii/S0950705119301741","url_pdf":"https://www.sciencedirect.com/science/article/abs/pii/S0950705119301741","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":"sparse-bayesian-approach-for-metric-learning","repo_url":"https://github.com/GT-Davood/SBML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"hyperspectral-image-classification","task_name":"Hyperspectral Image Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"intrusion-detection","task_name":"Intrusion Detection"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"network-intrusion-detection","task_name":"Network Intrusion Detection"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"GT-Davood/SBML","kind":"listed","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":"4d2d69865960465ac8a890877978e55ed52347b85aa3b565f00de674469d594f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}