Show simple item record

dc.contributor.authorYang, E
dc.contributor.authorHao, F
dc.contributor.authorYang, Y
dc.contributor.authorDe Maio, C
dc.contributor.authorNasridinov, A
dc.contributor.authorMin, G
dc.contributor.authorYang, LT
dc.date.accessioned2021-06-22T05:38:59Z
dc.date.issued2021-06-17
dc.description.abstractKnowledge graph describes entities by numerous RDF data (subject-predicate-object triples), which has been widely applied in various fields, such as artificial intelligence, Semantic Web, entity summarization. With time elapses, the continuously increasing RDF descriptions of entity lead to information overload and further cause people confused. With this backdrop, automatic entity summarization has received much attention in recent years, aiming to select the most concise and most typical facts that depict an entity in brief from lengthy RDF data. As new descriptions of entity are continually coming, creating a compact summary of entity quickly from a lengthy knowledge graph is challenging. To address this problem, this paper firstly formulates the problem and proposes a novel approach of Incremental Entity Summarization by leveraging Formal Concept Analysis (FCA), called IES-FCA. Additionally, we not only prove the rationality of our suggested method mathematically, but also carry out extensive experiments using two real-world datasets. The experimental results demonstrate that the proposed method IES-FCA can save about 8.7% of time consumption for all entities than the non-incremental entity summarization approach KAFCA at best. As for the effectiveness, IES-FCA outperforms the state-of-the-art algorithms in terms of F1-measure, MAP, and NDCG.en_GB
dc.description.sponsorshipNational Natural Science Foundation of Chinaen_GB
dc.description.sponsorshipFundamental Research Funds for the Central Universitiesen_GB
dc.identifier.citationPublished online 17 June 2021en_GB
dc.identifier.doi10.1109/tsc.2021.3090276
dc.identifier.grantnumber61702317en_GB
dc.identifier.grantnumberGK202103080en_GB
dc.identifier.urihttp://hdl.handle.net/10871/126127
dc.language.isoenen_GB
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_GB
dc.rights© 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.en_GB
dc.subjectResource description frameworken_GB
dc.subjectLatticesen_GB
dc.subjectComputer scienceen_GB
dc.subjectSoftware algorithmsen_GB
dc.subjectContext modelingen_GB
dc.subjectSearch enginesen_GB
dc.subjectProbability distributionen_GB
dc.titleIncremental Entity Summarization with Formal Concept Analysisen_GB
dc.typeArticleen_GB
dc.date.available2021-06-22T05:38:59Z
dc.identifier.issn1939-1374
dc.descriptionThis is the author's accepted manuscript; the final version is available from IEEE via the DOI in this record.en_GB
dc.identifier.journalIEEE Transactions on Services Computingen_GB
dc.rights.urihttp://www.rioxx.net/licenses/all-rights-reserveden_GB
dcterms.dateAccepted2021-06-14
rioxxterms.funderEuropean Union Horizon 2020en_GB
rioxxterms.identifier.projectMarie Sklodowska-Curie grant agreement No 840922en_GB
rioxxterms.versionAMen_GB
rioxxterms.licenseref.startdate2021-06-14
rioxxterms.typeJournal Article/Reviewen_GB
refterms.dateFCD2021-06-21T07:19:13Z
refterms.versionFCDAM
refterms.dateFOA2021-06-22T05:39:16Z
refterms.panelBen_GB
rioxxterms.funder.projecte4e40680-5a3e-4e7d-be59-2b310fb34b18en_GB


Files in this item

This item appears in the following Collection(s)

Show simple item record