DATIS: Data Augmentation for Trust Intensity Prediction in Incomplete Signed Networks | 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 Research Article DATIS: Data Augmentation for Trust Intensity Prediction in Incomplete Signed Networks Shiva Shadrooh, Kjetil Nørvåg This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4481271/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 09 Jan, 2025 Read the published version in Social Network Analysis and Mining → Version 1 posted 9 You are reading this latest preprint version Abstract Prediction of trust and distrust in nodes in signed network analysis is an important task with diverse applications. However, the presence of imbalanced and incomplete rankings in signed networks makes prediction of node-level trust values using machine learning (ML) methods a very challenging task. To overcome these challenges, we introduce \method, an innovative approach employing generative adversarial networks (GANs) for data augmentation in node-level trust prediction tasks in signed networks. \method addresses imbalances in both sign and value of rankings, handling missing rankings by training on nodes' local and global network features without explicit information on edge rankings assigned to nodes. Unlike existing methods, we consider the trust prediction problem as a regression task to imply the strength of trust a node gained in a network. Our experimental evaluation shows that \methodcan significantly improve the accuracy of node-level trust intensity prediction on real-world datasets. Trust and Distrust Prediction Signed Networks Generative Adversarial Networks Node Ranking Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 09 Jan, 2025 Read the published version in Social Network Analysis and Mining → Version 1 posted Editorial decision: Revision requested 31 Aug, 2024 Reviews received at journal 11 Aug, 2024 Reviewers agreed at journal 21 Jul, 2024 Reviewers agreed at journal 19 Jul, 2024 Reviewers agreed at journal 24 Jun, 2024 Reviewers invited by journal 24 Jun, 2024 Editor assigned by journal 28 May, 2024 Submission checks completed at journal 27 May, 2024 First submitted to journal 26 May, 2024 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-4481271","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":311137479,"identity":"2d3ce7cc-eb26-46c0-ae96-9a83b66d7982","order_by":0,"name":"Shiva Shadrooh","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA4UlEQVRIiWNgGAWjYDACCcYGEJUARowNNqRrSWPgIawFQsG0HCasRX52c5vED4a6PP723IcPPu44n2cv3WPAXFCBW4vBnYNtkj0Mh4slzjw3Npx55nYxj8wZA+YZZ/BokUhsNuBhOJDYcCONTZq37XZij0SOATNvGx6HzUhsNvzDUJc4H6LlHGEtDDcSGx/zMDAnboBoOUBYiwFIi4zB4cSNZ54xG85sS07suZFWcJgHj1/kZ6Q/OPimoi5x3vE0xgcf2+wS22ckb3zMgyfEoHah8Q8Q0jAKRsEoGAWjAD8AAGarUlrc85SIAAAAAElFTkSuQmCC","orcid":"","institution":"Norwegian University of Science and Technology","correspondingAuthor":true,"prefix":"","firstName":"Shiva","middleName":"","lastName":"Shadrooh","suffix":""},{"id":311137480,"identity":"b01cb51d-841c-43cb-9ce6-60dc3417ab4d","order_by":1,"name":"Kjetil Nørvåg","email":"","orcid":"","institution":"Norwegian University of Science and Technology","correspondingAuthor":false,"prefix":"","firstName":"Kjetil","middleName":"","lastName":"Nørvåg","suffix":""}],"badges":[],"createdAt":"2024-05-26 20:09:24","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4481271/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4481271/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s13278-024-01403-w","type":"published","date":"2025-01-09T15:56:54+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":73693759,"identity":"c619c84d-f301-455e-adca-b2fcd3d92a34","added_by":"auto","created_at":"2025-01-13 16:05:25","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1213622,"visible":true,"origin":"","legend":"","description":"","filename":"DATISManuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4481271/v1_covered_a7187c7b-f9d2-482e-994b-5aae2881d746.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"DATIS: Data Augmentation for Trust Intensity Prediction in Incomplete Signed Networks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"social-network-analysis-and-mining","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"snam","sideBox":"Learn more about [Social Network Analysis and Mining](http://link.springer.com/journal/13278)","snPcode":"13278","submissionUrl":"https://submission.nature.com/new-submission/13278/3","title":"Social Network Analysis and Mining","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Trust and Distrust Prediction, Signed Networks, Generative Adversarial Networks, Node Ranking","lastPublishedDoi":"10.21203/rs.3.rs-4481271/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4481271/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003ePrediction of trust and distrust in nodes in signed network analysis is an important task with diverse applications. However, the presence of imbalanced and incomplete rankings in signed networks makes prediction of node-level trust values using machine learning (ML) methods a very challenging task. To overcome these challenges, we introduce \\method, an innovative approach employing generative adversarial networks (GANs) for data augmentation in node-level trust prediction tasks in signed networks. \\method addresses imbalances in both sign and value of rankings, handling missing rankings by training on nodes' local and global network features without explicit information on edge rankings assigned to nodes. Unlike existing methods, we consider the trust prediction problem as a regression task to imply the strength of trust a node gained in a network. Our experimental evaluation shows that \\methodcan significantly improve the accuracy of node-level trust intensity prediction on real-world datasets.\u003c/p\u003e","manuscriptTitle":"DATIS: Data Augmentation for Trust Intensity Prediction in Incomplete Signed Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-07 16:58:52","doi":"10.21203/rs.3.rs-4481271/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-08-31T18:25:52+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-08-12T02:18:50+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"300849303064476077427802161707111524878","date":"2024-07-21T10:35:38+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"189362957467046492068958194323269807475","date":"2024-07-19T10:36:15+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"118432844970098744683218664873337630949","date":"2024-06-24T13:37:27+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-06-24T11:09:31+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-05-29T03:49:24+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-05-27T12:34:41+00:00","index":"","fulltext":""},{"type":"submitted","content":"Social Network Analysis and Mining","date":"2024-05-26T20:08:08+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"social-network-analysis-and-mining","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"snam","sideBox":"Learn more about [Social Network Analysis and Mining](http://link.springer.com/journal/13278)","snPcode":"13278","submissionUrl":"https://submission.nature.com/new-submission/13278/3","title":"Social Network Analysis and Mining","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"1f230253-44a7-46a6-9eb2-02a2ab3cf748","owner":[],"postedDate":"June 7th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-01-13T15:58:36+00:00","versionOfRecord":{"articleIdentity":"rs-4481271","link":"https://doi.org/10.1007/s13278-024-01403-w","journal":{"identity":"social-network-analysis-and-mining","isVorOnly":false,"title":"Social Network Analysis and Mining"},"publishedOn":"2025-01-09 15:56:54","publishedOnDateReadable":"January 9th, 2025"},"versionCreatedAt":"2024-06-07 16:58:52","video":"","vorDoi":"10.1007/s13278-024-01403-w","vorDoiUrl":"https://doi.org/10.1007/s13278-024-01403-w","workflowStages":[]},"version":"v1","identity":"rs-4481271","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4481271","identity":"rs-4481271","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.