Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Data preprocessing stages, including data reconstruction and dimensionality reduction, play a pivotal role in influencing subsequent machine learning and data mining endeavors. While supervised dimensionality reduction typically surpasses unsupervised methods through direct label exploitation, the scarcity or high acquisition cost of labeled data in practical scenarios has fueled interest in semi-supervised alternatives. These methodologies ingeniously integrate sparse labeled and abundant unlabeled data, to aid data representation and dimensionality reduction.This study introduces a novel nonlinear semi-supervised dimensionality reduction algorithm, which employs pairwise constraints (must-link and cannot-link) and radial basis functions to obtain similarity and dissimilarity among data points. Leveraging spectral decomposition, our algorithm aims to reconstruct the initial data, thereby exposing intricate nonlinear patterns obscured within high-dimensional datasets. Compared to traditional semi-supervised algorithms, a series of experiments based on real data have verified the effectiveness of the proposed method.
Full text 10,498 characters · extracted from preprint-html · click to expand
Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data Zixuan Liu, Rong Luo This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4495676/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Data preprocessing stages, including data reconstruction and dimensionality reduction, play a pivotal role in influencing subsequent machine learning and data mining endeavors. While supervised dimensionality reduction typically surpasses unsupervised methods through direct label exploitation, the scarcity or high acquisition cost of labeled data in practical scenarios has fueled interest in semi-supervised alternatives. These methodologies ingeniously integrate sparse labeled and abundant unlabeled data, to aid data representation and dimensionality reduction.This study introduces a novel nonlinear semi-supervised dimensionality reduction algorithm, which employs pairwise constraints (must-link and cannot-link) and radial basis functions to obtain similarity and dissimilarity among data points. Leveraging spectral decomposition, our algorithm aims to reconstruct the initial data, thereby exposing intricate nonlinear patterns obscured within high-dimensional datasets. Compared to traditional semi-supervised algorithms, a series of experiments based on real data have verified the effectiveness of the proposed method. Physical sciences/Mathematics and computing Physical sciences/Mathematics and computing/Applied mathematics Physical sciences/Mathematics and computing/Computer science Physical sciences/Mathematics and computing/Scientific data Physical sciences/Mathematics and computing/Statistics Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4495676","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":313316477,"identity":"536d9832-8bac-40d0-9565-2cbccbfae5ef","order_by":0,"name":"Zixuan Liu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA80lEQVRIiWNgGAWjYBACPmYQaWAjB+HygEkDvFrYwFoK0oyhWgyI0AImPxxObGBAWEBACzuP8WceA+b0tTMSmD/zyPxJbGBv3ibBUHMHj8N4DAxnGLDlbruRwCbNw2OQ2MBzrEyC4dgzvFoSPhjwgLUw54C0SOSYSTA2HMar5UCCgUS62Q2gw8Ba5N8Q1GLY8MHAIAGohUEaYgsPIS1sxYwzDBIMt5152Cb9h8fYuI0nrdgi4RhuLfz8hzd/5vnzX97sePLhjzN75GT72Q9vvPGhBrcWBBAARg1jDzSmEojQALTvAJD4QZTSUTAKRsEoGGEAANz8SeFswEbeAAAAAElFTkSuQmCC","orcid":"","institution":"Southwest Jiaotong University","correspondingAuthor":true,"prefix":"","firstName":"Zixuan","middleName":"","lastName":"Liu","suffix":""},{"id":313316478,"identity":"fa0c1242-9c7d-4c42-8cb6-7d5776d6cab5","order_by":1,"name":"Rong Luo","email":"","orcid":"","institution":"Southwest Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Rong","middleName":"","lastName":"Luo","suffix":""}],"badges":[],"createdAt":"2024-05-29 08:55:29","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-4495676/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4495676/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":59235735,"identity":"0f65e490-54ac-4970-9b16-51e74f6890f3","added_by":"auto","created_at":"2024-06-28 03:54:36","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":3577094,"visible":true,"origin":"","legend":"","description":"","filename":"0530.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4495676/v1_covered_13794fb7-ef8f-466f-b85a-baf9483b7274.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-4495676/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4495676/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Data preprocessing stages, including data reconstruction and dimensionality reduction, play a pivotal role in influencing subsequent machine learning and data mining endeavors. While supervised dimensionality reduction typically surpasses unsupervised methods through direct label exploitation, the scarcity or high acquisition cost of labeled data in practical scenarios has fueled interest in semi-supervised alternatives. These methodologies ingeniously integrate sparse labeled and abundant unlabeled data, to aid data representation and dimensionality reduction.This study introduces a novel nonlinear semi-supervised dimensionality reduction algorithm, which employs pairwise constraints (must-link and cannot-link) and radial basis functions to obtain similarity and dissimilarity among data points. Leveraging spectral decomposition, our algorithm aims to reconstruct the initial data, thereby exposing intricate nonlinear patterns obscured within high-dimensional datasets. Compared to traditional semi-supervised algorithms, a series of experiments based on real data have verified the effectiveness of the proposed method.","manuscriptTitle":"Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-12 14:15:58","doi":"10.21203/rs.3.rs-4495676/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"8f9847a8-5981-48e0-8871-8d20555d6eb4","owner":[],"postedDate":"June 12th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":33126591,"name":"Physical sciences/Mathematics and computing"},{"id":33126592,"name":"Physical sciences/Mathematics and computing/Applied mathematics"},{"id":33126593,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":33126595,"name":"Physical sciences/Mathematics and computing/Scientific data"},{"id":33126597,"name":"Physical sciences/Mathematics and computing/Statistics"}],"tags":[],"updatedAt":"2024-06-28T03:46:29+00:00","versionOfRecord":[],"versionCreatedAt":"2024-06-12 14:15:58","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4495676","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4495676","identity":"rs-4495676","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00