In this paper, we consider the Alexandroff topology for texture spaces. We prove that there exists a one-to-one correspondence between the Alexandroff ditopologies, and the reflexive and transitive...
{"title":"Textures and Fuzzy Rough Sets","authors":"DikerMurat","doi":"10.5555/2361314.2361322","DOIUrl":"https://doi.org/10.5555/2361314.2361322","url":null,"abstract":"In this paper, we consider the Alexandroff topology for texture spaces. We prove that there exists a one-to-one correspondence between the Alexandroff ditopologies, and the reflexive and transitive...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a general framework for the study of fuzzy rough approximation operators determined by a triangular norm in infinite universes of discourse is investigated. Lower and upper approxima...
本文研究了无限论域中由三角范数确定的模糊粗糙逼近算子的一般框架。上下近似…
{"title":"On Some Mathematical Structures of T-Fuzzy Rough Set Algebras in Infinite Universes of Discourse","authors":"WuWei-Zhi","doi":"10.5555/2361314.2361323","DOIUrl":"https://doi.org/10.5555/2361314.2361323","url":null,"abstract":"In this paper, a general framework for the study of fuzzy rough approximation operators determined by a triangular norm in infinite universes of discourse is investigated. Lower and upper approxima...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stepwise refinement is a well-known strategy in system modeling. The refinement rules should preserve essential behavioral properties, such as deadlock freedom, boundedness and weak termination. A well-known example is the refinement rule that replaces a safe place of a Petri net with a sound workflow net. In this case a token on the refined place undergoes a procedure that is modeled in detail by the refining workflow net.
{"title":"Refinement of Synchronizable Places with Multi-workflow Nets","authors":"K. V. Hee, N. Sidorova, J. V. D. Werf","doi":"10.3233/FI-2013-783","DOIUrl":"https://doi.org/10.3233/FI-2013-783","url":null,"abstract":"Stepwise refinement is a well-known strategy in system modeling. The refinement rules should preserve essential behavioral properties, such as deadlock freedom, boundedness and weak termination. A well-known example is the refinement rule that replaces a safe place of a Petri net with a sound workflow net. In this case a token on the refined place undergoes a procedure that is modeled in detail by the refining workflow net.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78763960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as “semirings without distributivity”. A very important example for the latter are bounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally finite, then the classes of recognizable and mc-rational trace series coincide and, in general, are properly contained in the class of c-rational series. Moreover, if, in addition, in the bimonoid the addition is idempotent and the multiplication is commutative, then all three classes coincide.
{"title":"A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices","authors":"Martin Huschenbett","doi":"10.3233/FI-2011-586","DOIUrl":"https://doi.org/10.3233/FI-2011-586","url":null,"abstract":"We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as “semirings without distributivity”. A very important example for the latter are bounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally finite, then the classes of recognizable and mc-rational trace series coincide and, in general, are properly contained in the class of c-rational series. Moreover, if, in addition, in the bimonoid the addition is idempotent and the multiplication is commutative, then all three classes coincide.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76377805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as a multiobjective ...
{"title":"Unsupervised and Supervised Learning Approaches Together for Microarray Analysis","authors":"SahaIndrajit, MaulikUjjwal, BandyopadhyaySanghamitra, PlewczynskiDariusz","doi":"10.5555/1971700.1971703","DOIUrl":"https://doi.org/10.5555/1971700.1971703","url":null,"abstract":"In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as a multiobjective ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71124640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C ...
{"title":"Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem","authors":"DeorowiczSebastian","doi":"10.5555/1834610.1834613","DOIUrl":"https://doi.org/10.5555/1834610.1834613","url":null,"abstract":"The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71123391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Satellite image classification is a complex process that may be affected by many factors. This article addresses the problem of pixel classification of satellite images by a robust multiple classif...
{"title":"A Robust Multiple Classifier System for Pixel Classification of Remote Sensing Images","authors":"MaulikUjjwal, ChakrabortyDebasis","doi":"10.5555/1883472.1883475","DOIUrl":"https://doi.org/10.5555/1883472.1883475","url":null,"abstract":"Satellite image classification is a complex process that may be affected by many factors. This article addresses the problem of pixel classification of satellite images by a robust multiple classif...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71123583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In many applications, clusters tend to have vague or imprecise boundaries. It is desirable that clustering techniques should consider such an issue. The decision-theoretic rough set (DTRS) model is a typical probabilistic rough set model, which has the ability to deal with imprecise, uncertain, and vague information. This paper proposes an autonomous clustering method using the decision-theoretic rough set model based on a knowledge-oriented clustering framework. In order to get the initial knowledge-oriented clustering, the threshold values are produced autonomously based on semantics of clustering without human intervention. Furthermore, this paper estimates the risk of a clustering scheme based on the decision-theoretic rough set by considering various loss functions, which can process the different granular overlapping boundary. An autonomous clustering algorithm is proposed, which is not only experimented with the synthetic data and the standard data but also applied in the web search results clustering. The results of experiments show that the proposed method is effective and efficient.
{"title":"Autonomous Knowledge-oriented Clustering Using Decision-Theoretic Rough Set Theory","authors":"Hong Yu, Shuangshuang Chu, Dachun Yang","doi":"10.3233/FI-2012-646","DOIUrl":"https://doi.org/10.3233/FI-2012-646","url":null,"abstract":"In many applications, clusters tend to have vague or imprecise boundaries. It is desirable that clustering techniques should consider such an issue. The decision-theoretic rough set (DTRS) model is a typical probabilistic rough set model, which has the ability to deal with imprecise, uncertain, and vague information. This paper proposes an autonomous clustering method using the decision-theoretic rough set model based on a knowledge-oriented clustering framework. In order to get the initial knowledge-oriented clustering, the threshold values are produced autonomously based on semantics of clustering without human intervention. Furthermore, this paper estimates the risk of a clustering scheme based on the decision-theoretic rough set by considering various loss functions, which can process the different granular overlapping boundary. An autonomous clustering algorithm is proposed, which is not only experimented with the synthetic data and the standard data but also applied in the web search results clustering. The results of experiments show that the proposed method is effective and efficient.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2010-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90656714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The majority of today's systems increasingly require sophisticated data management as they need to store and to query large amounts of data for analysis and reporting purposes. In order to keep more "detailed" data available for longer periods, "old" data has to be reduced gradually to save space and improve query performance, especially on resource-constrained systems with limited storage and query processing capabilities. A number of data reduction solutions have been developed, however an effective solution particularly based on gradual data reduction is missing. This paper presents an effective solution for data reduction based on gradual granular data aggregation. With the gradual granular data aggregation mechanism, older data can be made coarse-grained while keeping the newest data fine-grained. For instance, when data is 3 months old aggregate to 1 minute level from 1 second level, when data is 6 months old aggregate to 2 minutes level from 1 minute level and so on. The proposed solution introduces a time granularity based data structure, namely a relational time granularity table that enables long term storage of old data by maintaining it at different levels of granularity and effective query processing due to a reduction in data volume. In addition, the paper describes the implementation strategy derived from a farming case study using standard technologies.
{"title":"Using a Time Granularity Table for Gradual Granular Data Aggregation","authors":"N. Iftikhar, T. Pedersen","doi":"10.3233/FI-2014-1039","DOIUrl":"https://doi.org/10.3233/FI-2014-1039","url":null,"abstract":"The majority of today's systems increasingly require sophisticated data management as they need to store and to query large amounts of data for analysis and reporting purposes. In order to keep more \"detailed\" data available for longer periods, \"old\" data has to be reduced gradually to save space and improve query performance, especially on resource-constrained systems with limited storage and query processing capabilities. A number of data reduction solutions have been developed, however an effective solution particularly based on gradual data reduction is missing. This paper presents an effective solution for data reduction based on gradual granular data aggregation. With the gradual granular data aggregation mechanism, older data can be made coarse-grained while keeping the newest data fine-grained. For instance, when data is 3 months old aggregate to 1 minute level from 1 second level, when data is 6 months old aggregate to 2 minutes level from 1 minute level and so on. The proposed solution introduces a time granularity based data structure, namely a relational time granularity table that enables long term storage of old data by maintaining it at different levels of granularity and effective query processing due to a reduction in data volume. In addition, the paper describes the implementation strategy derived from a farming case study using standard technologies.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76696634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：