Analyzing the Reliability of the Grouping-Based Concept Lattice Reductions and a Method for Improving It

preprint OA: closed
Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-17

This paper analyzes the reliability of grouping-based concept lattice reductions and proposes a novel integer linear programming method for more reliable reductions with improved context and lattice fidelity.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-17 · read from full text

This preprint studies formal concept analysis (FCA) and the problem that grouping-based concept lattice reduction methods can produce simplified lattices that distort the original relational context and make results unreliable. Using the idea of measuring reliability in terms of both context fidelity and lattice fidelity, the authors present an improved grouping-based concept lattice reduction method formulated as an integer linear programming model, and they evaluate it via experiments on several datasets. The main caveat stated is that prior grouping-based reductions may introduce too much information distortion, motivating the need for explicit fidelity-based reliability assessment. Relevance to endometriosis: it does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Formal concept analysis (FCA) is an important task for analyzing rela-tional data as well as extracting formalized knowledge from them. It has a wide range of practical applications, while a problem is frequently encountered that the extracted knowledge, i.e., the concept lattice may be too complicated for further processing and/or analysis. To reduce the concept lattice, various branches of techniques have been proposed and one of the most preferred categories of methods is the grouping-based simplification methods which aim at reducing the volume of the concept lattice by removing the redundant objects/attributes. However, we figure out that these methods may introduce too much information distortion to the context and the concept lattice, making the reduction result unreliable. To identify and overcome these problems, we propose a method for analyzing the reliability of a reduction in terms of context fidelity and lattice fidelity as well as a novel grouping-based concept lattice reduction method using an integer linear programming model. We conduct experiments on several data sets to prove that our method works in different cases and can produce more reliable reductions.
Full text 10,008 characters · extracted from preprint-html · click to expand
Analyzing the Reliability of the Grouping-Based Concept Lattice Reductions and a Method for Improving It | 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 Analyzing the Reliability of the Grouping-Based Concept Lattice Reductions and a Method for Improving It Siqi Peng, Akihiro Yamamoto This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1691428/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 Formal concept analysis (FCA) is an important task for analyzing rela-tional data as well as extracting formalized knowledge from them. It has a wide range of practical applications, while a problem is frequently encountered that the extracted knowledge, i.e., the concept lattice may be too complicated for further processing and/or analysis. To reduce the concept lattice, various branches of techniques have been proposed and one of the most preferred categories of methods is the grouping-based simplification methods which aim at reducing the volume of the concept lattice by removing the redundant objects/attributes. However, we figure out that these methods may introduce too much information distortion to the context and the concept lattice, making the reduction result unreliable. To identify and overcome these problems, we propose a method for analyzing the reliability of a reduction in terms of context fidelity and lattice fidelity as well as a novel grouping-based concept lattice reduction method using an integer linear programming model. We conduct experiments on several data sets to prove that our method works in different cases and can produce more reliable reductions. Concept Lattice Reduction Formal Concept Analysis Integer Linear Programming Data Mining 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-1691428","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":108992789,"identity":"944a5052-f297-4bb9-b1b0-f01339d1e93d","order_by":0,"name":"Siqi Peng","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABMUlEQVRIie2QMUvDQBiG3yOQOJxkvQz9D1cO0vbfJBQyZXOJIOGyXJeqf0D0N7gUx5RAXE7nbkYK4tAhbg6FmpSoaIKugnmml+94eL/vgJ6evwuDCev2FVGV6deHnxTqMegq1Ur6u7KHM6K+Kx2MrNPsGdvx4AzwxPFlHIPq4bqM4EsrKzC5aSmT+X0wJooJBZL6d4uM4XAueKorhQYcjm4vswpdTiTzVdWyTBYpg01dtlQ7XyIEHNVWHjYux3avDJPkIn5XqhZ7062sqChg7hVBEmnUizUK626ZzEMXfn2LQQMi88xRND/iWkMo9sTTjltGlhZluY0HV7NZTuRJbNt0el1EEQbn9vRx7bR/jKPaygOINJqJiQPeBCBzZJdilKiVz5lVfETy0lZ6enp6/h1v9YFiKUVXLoAAAAAASUVORK5CYII=","orcid":"","institution":"Kyoto University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Siqi","middleName":"","lastName":"Peng","suffix":""},{"id":108992791,"identity":"bd1f748d-4f8a-432a-97e8-1d5625e0acb3","order_by":1,"name":"Akihiro Yamamoto","email":"","orcid":"","institution":"Kyoto University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Akihiro","middleName":"","lastName":"Yamamoto","suffix":""}],"badges":[],"createdAt":"2022-05-25 07:44:23","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1691428/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1691428/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":22078084,"identity":"f1a85472-2549-4942-9c1b-860b16da79cc","added_by":"auto","created_at":"2022-05-31 15:46:43","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1123872,"visible":true,"origin":"","legend":"","description":"","filename":"snarticle.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1691428/v1_covered.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Analyzing the Reliability of the Grouping-Based Concept Lattice Reductions and a Method for Improving It","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1691428/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"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":false,"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":"Concept Lattice Reduction, Formal Concept Analysis, Integer Linear Programming, Data Mining","lastPublishedDoi":"10.21203/rs.3.rs-1691428/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1691428/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Formal concept analysis (FCA) is an important task for analyzing rela-tional data as well as extracting formalized knowledge from them. It has a wide range of practical applications, while a problem is frequently encountered that the extracted knowledge, i.e., the concept lattice may be too complicated for further processing and/or analysis. To reduce the concept lattice, various branches of techniques have been proposed and one of the most preferred categories of methods is the grouping-based simplification methods which aim at reducing the volume of the concept lattice by removing the redundant objects/attributes. However, we figure out that these methods may introduce too much information distortion to the context and the concept lattice, making the reduction result unreliable. To identify and overcome these problems, we propose a method for analyzing the reliability of a reduction in terms of context fidelity and lattice fidelity as well as a novel grouping-based concept lattice reduction method using an integer linear programming model. We conduct experiments on several data sets to prove that our method works in different cases and can produce more reliable reductions.","manuscriptTitle":"Analyzing the Reliability of the Grouping-Based Concept Lattice Reductions and a Method for Improving It","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-05-31 15:46:37","doi":"10.21203/rs.3.rs-1691428/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":"881cf63a-6578-460a-8911-7fa706a08739","owner":[],"postedDate":"May 31st, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2022-05-31T15:46:38+00:00","versionOfRecord":[],"versionCreatedAt":"2022-05-31 15:46:37","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1691428","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1691428","identity":"rs-1691428","version":["v1"]},"buildId":"FbvkV6FR0MCFSLy54lSbu","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00