{"title":"通过形式概念对布尔数据进行因式分解的语义探索","authors":"Radim Belohlavek, Martin Trnecka","doi":"10.1016/j.ijar.2024.109247","DOIUrl":null,"url":null,"abstract":"<div><p>We use now available psychological data involving human concepts, objects covered by these concepts, and binary attributes describing the objects to explore selected semantic aspects of Boolean matrix factorization. Our basic perspective derives from the intuitive requirement that the factors computed from data should represent natural categories latently present in the data. This idea is examined for factorization algorithms that utilize formal concepts to build factors. We provide several experimental observations which imply that the inspected factorization methods deliver semantically sound factors that resemble significant human concepts of the examined domains.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"173 ","pages":"Article 109247"},"PeriodicalIF":3.2000,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Semantic explorations in factorizing Boolean data via formal concepts\",\"authors\":\"Radim Belohlavek, Martin Trnecka\",\"doi\":\"10.1016/j.ijar.2024.109247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We use now available psychological data involving human concepts, objects covered by these concepts, and binary attributes describing the objects to explore selected semantic aspects of Boolean matrix factorization. Our basic perspective derives from the intuitive requirement that the factors computed from data should represent natural categories latently present in the data. This idea is examined for factorization algorithms that utilize formal concepts to build factors. We provide several experimental observations which imply that the inspected factorization methods deliver semantically sound factors that resemble significant human concepts of the examined domains.</p></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"173 \",\"pages\":\"Article 109247\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2024-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Approximate Reasoning\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0888613X24001348\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X24001348","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Semantic explorations in factorizing Boolean data via formal concepts
We use now available psychological data involving human concepts, objects covered by these concepts, and binary attributes describing the objects to explore selected semantic aspects of Boolean matrix factorization. Our basic perspective derives from the intuitive requirement that the factors computed from data should represent natural categories latently present in the data. This idea is examined for factorization algorithms that utilize formal concepts to build factors. We provide several experimental observations which imply that the inspected factorization methods deliver semantically sound factors that resemble significant human concepts of the examined domains.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.