Probabilistic estimation of stop words from document-term matrix for topic analysis application.

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract In topic analysis, it is important to remove stop words to make inference about topics. Prior knowledge about the data is necessary to remove stop words. Stop words imply no contribution and interference of topic estimation. There is a suggestion of probabilistic inference of stop words. Probabilistic inference of stop words without prior knowledge about the data will assist in topic analysis application to unfamiliar languages and other various data fields.
Full text 8,398 characters · extracted from preprint-html · click to expand
Probabilistic estimation of stop words from document-term matrix for topic analysis application. | 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 Probabilistic estimation of stop words from document-term matrix for topic analysis application. Nami Harada, Yutaka Kano This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4301042/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 In topic analysis, it is important to remove stop words to make inference about topics. Prior knowledge about the data is necessary to remove stop words. Stop words imply no contribution and interference of topic estimation. There is a suggestion of probabilistic inference of stop words. Probabilistic inference of stop words without prior knowledge about the data will assist in topic analysis application to unfamiliar languages and other various data fields. Biclustering Natural language processing Principal component analysis Probabilistic inference Stop words Full Text Additional Declarations Competing interest reported. Publication of this paper is required for my ph.D degree 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-4301042","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":300413336,"identity":"7025e4b7-32d1-489e-b678-1387197f939a","order_by":0,"name":"Nami Harada","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6klEQVRIiWNgGAWjYJCCw2DyABB/AGI2dlK0MM4AaWEmQgszTAszD4KLG5izn048XFBzT57v+NmHj21+bZPnY2Zg/PAxB7cWy57cDYdnHCs2nHkm3dg4t++2YRszA7PkzG24tRgcAGrhYUtg3HAgjU06t+c2I1ALGzMvPi3n3wK1/Euw33D+Gftvy57b9oS13ADawtuWkLjhRhowrH7cTiRCC9AW3r6E5Jk3njFL9jbcTm5jZmzG75fzuZs/83xLsO07n8b44cef27bz25sPfviIRwsqYGwDkw3EqgeBP6QoHgWjYBSMgpECAJJBV2d07pYzAAAAAElFTkSuQmCC","orcid":"","institution":"Osaka University","correspondingAuthor":true,"prefix":"","firstName":"Nami","middleName":"","lastName":"Harada","suffix":""},{"id":300413338,"identity":"76ce3ac2-16b2-4284-b9de-7f4423cf903d","order_by":1,"name":"Yutaka Kano","email":"","orcid":"","institution":"Doshisha University","correspondingAuthor":false,"prefix":"","firstName":"Yutaka","middleName":"","lastName":"Kano","suffix":""}],"badges":[],"createdAt":"2024-04-21 14:01:01","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4301042/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4301042/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":56767545,"identity":"1b0197bb-28d4-4f36-bfce-a269fe5010e0","added_by":"auto","created_at":"2024-05-20 08:37:43","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":401077,"visible":true,"origin":"","legend":"","description":"","filename":"paaharada.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4301042/v1_covered_d1f5e1ff-7971-4d0c-8401-07c2dbab6484.pdf"}],"financialInterests":"Competing interest reported. Publication of this paper is required for my ph.D degree","formattedTitle":"Probabilistic estimation of stop words from document-term matrix for topic analysis application.","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":false,"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":"Biclustering, Natural language processing, Principal component analysis, Probabilistic inference, Stop words","lastPublishedDoi":"10.21203/rs.3.rs-4301042/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4301042/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn topic analysis, it is important to remove stop words to make inference about topics. Prior knowledge about the data is necessary to remove stop words. Stop words imply no contribution and interference of topic estimation. There is a suggestion of probabilistic inference of stop words. Probabilistic inference of stop words without prior knowledge about the data will assist in topic analysis application to unfamiliar languages and other various data fields.\u003c/p\u003e","manuscriptTitle":"Probabilistic estimation of stop words from document-term matrix for topic analysis application.","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-05-10 13:22:17","doi":"10.21203/rs.3.rs-4301042/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":"ce33e7db-f160-403c-928f-d730e01ecbee","owner":[],"postedDate":"May 10th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-05-20T08:29:36+00:00","versionOfRecord":[],"versionCreatedAt":"2024-05-10 13:22:17","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4301042","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4301042","identity":"rs-4301042","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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