发布求助
文献互助 智能选刊 最新文献

Scalable Fuzzy Algorithms for Data Management and Analysis最新文献

筛选
英文 中文
Fuzzy Association Rules to Summarise Multiple Taxonomies in Large Databases 基于模糊关联规则对大型数据库中多个分类进行汇总
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH011
T. Martin, Yun Shen
{"title":"Fuzzy Association Rules to Summarise Multiple Taxonomies in Large Databases","authors":"T. Martin, Yun Shen","doi":"10.4018/978-1-60566-858-1.CH011","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH011","url":null,"abstract":"A key feature of human intelligence is our ability to categorise and summarise large quantities of data, whether this data arises from sensory input or from other sources. The ability to group multiple entities together into an (approximately) uniform whole allows us to efficiently represent a whole group as a single concept, enabling us to reason, and to derive knowledge, about groups of entities. A simple form of derived knowledge is association essentially, that the extensions of two concepts overlap significantly. One of the fundamental tenets underlying fuzzy set theory (Zadeh, 1965) is the idea that humans work with groups of entities (or conceptual categories) that are loosely defined, able to admit elements according to some scale of membership rather than according to an absolute yes/no test. This AbsTRACT","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114727672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Scalable Reasoning with Tractable Fuzzy Ontology Languages 基于可处理模糊本体语言的可扩展推理
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH005
G. Stoilos, Jeff Z. Pan, G. Stamou
{"title":"Scalable Reasoning with Tractable Fuzzy Ontology Languages","authors":"G. Stoilos, Jeff Z. Pan, G. Stamou","doi":"10.4018/978-1-60566-858-1.CH005","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH005","url":null,"abstract":"The last couple of years it is widely acknowledged that uncertainty and fuzzy extensions to ontology languages, like description logics (DLs) and OWL, could play a significant role in the improvement of many Semantic Web (SW) applications like matching, merging and ranking. Unfortunately, existing fuzzy reasoners focus on very expressive fuzzy ontology languages, like OWL, and are thus not able to handle the scale of data that the Web provides. For those reasons much research effort has been focused on providing fuzzy extensions and algorithms for tractable ontology languages. In this chapter, the authors present some recent results about reasoning and fuzzy query answering over tractable/polynomial fuzzy ontology languages namely Fuzzy DL-Lite and Fuzzy EL+. Fuzzy DL-Lite provides scalable algorithms for very expressive (extended) conjunctive queries, while Fuzzy EL+ provides polynomial algorithms for knowledge classification. For the Fuzzy DL-Lite case the authors will also report on an implementation in the ONTOSEARCH2 system and preliminary, but encouraging, benchmarking results.","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134018512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Random Set and Prototype Theory Model of Linguistic Query Evaluation 语言查询评价的随机集和原型理论模型
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH006
J. Lawry, Yongchuan Tang
{"title":"A Random Set and Prototype Theory Model of Linguistic Query Evaluation","authors":"J. Lawry, Yongchuan Tang","doi":"10.4018/978-1-60566-858-1.CH006","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH006","url":null,"abstract":"The term computing with words was introduced by Zadeh (Zadeh 1996), (Zadeh 2002) to refer to computation involving natural language expression and queries. Such an approach allows for a high-level and intuitive representation of information which is vital for the development of transparent humanunderstandable decision making software tools. Zadeh proposed a methodology for computing with words incorporating fuzzy set theory and fuzzy quantifiers. Label semantics (Lawry 2004), (Lawry 2006) is an alternative framework for linguistic modeling based on random set theory and where emphasis is given to decisions concerning the appropriateness of labels to describe a particular instance or object. Recent work has demonstrated a clear and natural link between label semantics and the prototype theory of concepts. In this paper we will propose a new methodology for evaluating queries about a database which involve both linguistic expressions and generalized (linguistic) quantifiers. This approach will be based on the combination of prototype theory and random set theory underlying the interpretation of AbsTRACT","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134221964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Using Fuzzy Song Sets in Music Warehouses 在音乐仓库中使用模糊歌曲集
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH003
François Deliège, T. Pedersen
{"title":"Using Fuzzy Song Sets in Music Warehouses","authors":"François Deliège, T. Pedersen","doi":"10.4018/978-1-60566-858-1.CH003","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH003","url":null,"abstract":"","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117182405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
(Approximate) Frequent Item Set Mining Made Simple with a Split and Merge Algorithm (近似)频繁项集挖掘通过拆分和合并算法变得简单
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH010
C. Borgelt, Xiaomeng Wang
{"title":"(Approximate) Frequent Item Set Mining Made Simple with a Split and Merge Algorithm","authors":"C. Borgelt, Xiaomeng Wang","doi":"10.4018/978-1-60566-858-1.CH010","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH010","url":null,"abstract":"In this paper we introduce SaM, a split and merge algorithm for frequent item set mining. Its core advantages are its extremely simple data structure and processing scheme, which not only make it very easy to implement, but also fairly easy to execute on external storage, thus rendering it a highly useful method if the data to mine cannot be loaded into main memory. Furthermore, we present extensions of this algorithm, which allow for approximate or “fuzzy” frequent item set mining in the sense that missing items can be inserted into transactions with a user-specified penalty. Finally, we present experiments comparing our new method with classical frequent item set mining algorithms (like Apriori, Eclat and FP-growth) and with the approximate frequent item set mining version of RElim (an algorithm we proposed in an earlier paper and improved in the meantime).","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128360637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A Flexible Language for Exploring Clustered Search Results 探索聚类搜索结果的灵活语言
Scalable Fuzzy Algorithms for Data Management and Analysis Pub Date : 1900-01-01 DOI: 10.4018/978-1-60566-858-1.CH007
Gloria Bordogna, A. Campi, S. Ronchi, G. Psaila
{"title":"A Flexible Language for Exploring Clustered Search Results","authors":"Gloria Bordogna, A. Campi, S. Ronchi, G. Psaila","doi":"10.4018/978-1-60566-858-1.CH007","DOIUrl":"https://doi.org/10.4018/978-1-60566-858-1.CH007","url":null,"abstract":"","PeriodicalId":293388,"journal":{"name":"Scalable Fuzzy Algorithms for Data Management and Analysis","volume":"5 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114031896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信