Soft General Rough Formal Context

Author(s):  
Li Fu
Keyword(s):  
2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.


Information ◽  
2018 ◽  
Vol 9 (9) ◽  
pp. 228 ◽  
Author(s):  
Zuping Zhang ◽  
Jing Zhao ◽  
Xiping Yan

Web page clustering is an important technology for sorting network resources. By extraction and clustering based on the similarity of the Web page, a large amount of information on a Web page can be organized effectively. In this paper, after describing the extraction of Web feature words, calculation methods for the weighting of feature words are studied deeply. Taking Web pages as objects and Web feature words as attributes, a formal context is constructed for using formal concept analysis. An algorithm for constructing a concept lattice based on cross data links was proposed and was successfully applied. This method can be used to cluster the Web pages using the concept lattice hierarchy. Experimental results indicate that the proposed algorithm is better than previous competitors with regard to time consumption and the clustering effect.


Author(s):  
Adan Torres-Torres ◽  
Ezequiel Notario-Priego ◽  
Ana Cecilia Martinez-Gutierrez ◽  
Angela Del Carmen Mendoza-Wilson

At present, it is very important to carry out an analysis of the productivity of the organization, because it is necessary to know where it is and where it is going, this in order to have a clear idea of the present, as well as future plans . In this work, a comprehensive and reliable scenario will be designed through formal context measurement tools that allow us to develop a proposal for a development model. The research will work under a quantitative approach because the observed phenomena are measured and quantified by giving a statistical analysis, in addition to the types of research used; documentary, since documents and statistics will be used to perform the analysis in addition to applying surveys and evaluations to pharmacies belonging to said area and the correlational, since the context variables, their interrelation, will be analyzed to determine their impact on the research . This work will increase the benefits for the organization, including having current data and statistics about productivity, as well as a proposal for improvement that will allow us to reduce the deficiencies in the organization in order to achieve a competitive advantage over its competitors.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Li Yang ◽  
Yang Xu

This paper is the continuation of our research work about lattice-valued concept lattice based on lattice implication algebra. For a better application of lattice-valued concept lattice into data distributed storage and parallel processing, it is necessary to research attribute extended algorithm based on congener formal context. The definitions of attribute extended formal context and congener formal context are proposed. On condition that the extent set stays invariable when the new attribute is increased, the necessary and sufficient conditions of forming attribute values are researched. Based on these conditions, the algorithms of generating lattice-valued congener formal context and establishing concept lattice are given, by which we can provide a useful basis for union algorithm and constructing algorithm of lattice-valued concept lattices in distributed and parallel system.


2020 ◽  
Vol 39 (3) ◽  
pp. 2783-2790
Author(s):  
Qian Hu ◽  
Ke-Yun Qin

The construction of concept lattices is an important research topic in formal concept analysis. Inspired by multi-granularity rough sets, multi-granularity formal concept analysis has become a new hot research issue. This paper mainly studies the construction methods of concept lattices in multi-granularity formal context. The relationships between concept forming operators under different granularity are discussed. The mutual transformation methods of formal concepts under different granularity are presented. In addition, the approaches of obtaining coarse-granularity concept lattice by fine-granularity concept lattice and fine-granularity concept lattice by coarse-granularity concept lattice are examined. The related algorithms for generating concept lattices are proposed. The practicability of the method is illustrated by an example.


Information ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 78 ◽  
Author(s):  
Jingpu Zhang ◽  
Ronghui Liu ◽  
Ligeng Zou ◽  
Licheng Zeng

Formal concept analysis has proven to be a very effective method for data analysis and rule extraction, but how to build formal concept lattices is a difficult and hot topic. In this paper, an efficient and rapid incremental concept lattice construction algorithm is proposed. The algorithm, named FastAddExtent, is seen as a modification of AddIntent in which we improve two fundamental procedures, including fixing the covering relation and searching the canonical generator. The proposed algorithm can locate the desired concept quickly by adding data fields to every concept. The algorithm is depicted in detail, using a formal context to show how the new algorithm works and discussing time and space complexity issues. We also present an experimental evaluation of its performance and comparison with AddExtent. Experimental results show that the FastAddExtent algorithm can improve efficiency compared with the primitive AddExtent algorithm.


Author(s):  
Aldo Gangemi ◽  
Valentina Presutti

In this chapter we show a simple example of how different but complementary approaches to enterprise business interaction modeling (e.g., business process management, business objects, e-services, workflow management systems, etc.) can be reengineered and integrated within a same formal context. Our method is based on content ontology design patterns (CODePs), which provide a conceptual tool to build content modularly, and to describe an enterprise and its interactions in the same domain of discourse as its social and informational contexts. The objectives of our method include: (1) encoding the requirements from the communities of practice involved in business interactions; (2) reengineering and integrating existing languages and ontologies for business interaction; (3) creating a formal infrastructure to represent the dependencies between enterprises, social interaction and practices, legal regulations, and the physical world. As a result, entities like organizations, roles, social relationships, material resources, information objects, workflows, events, and so forth, are represented according to a set of modular, interoperable ontologies.


2019 ◽  
Vol 26 (2) ◽  
pp. 221-243
Author(s):  
Samir Elloumi

AbstractTextual Feature Selection (TFS) aims to extract relevant parts or segments from text as being the most relevant ones w.r.t. the information it expresses. The selected features are useful for automatic indexing, summarization, document categorization, knowledge discovery, so on. Regarding the huge amount of electronic textual data daily published, many challenges related to the semantic aspect as well as the processing efficiency are addressed. In this paper, we propose a new approach for TFS based on Formal Concept Analysis background. Mainly, we propose to extract textual features by exploring the regularities in a formal context where isolated points exist. We introduce the notion ofN-composite isolated points as a set ofNwords to be considered as a unique textual feature. We show that a reduced value ofN(between 1 and 3) allows extracting significant textual features compared with existing approaches even for non-completely covering an initial formal context.


1987 ◽  
Vol 10 (2) ◽  
pp. 83-113 ◽  
Author(s):  
Manfred Pienemann

Abstract In this article it is claimed that there is a set of universal speech processing constraints which applies to all types of second language acquisition. These constraints define the range of possible hypotheses about the structure of the L2 which a learner can create at a given stage of development and cannot be overridden by formal instruction or by other alterations in the linguistic input. These claims, however, do not imply that all types of language acquisition are identical or that teaching has no influence whatsoever on the way a second language develops in a formal context. It has been shown elsewhere (cf. Pienemann, 1984, 1985, 1987a) that under certain conditions teaching can influence formal L2 development. These demonstrable positive effects of teaching, however, remain inside the variational margin left open by the processing constraints. The present paper reports on the interlanguage development of one learner of German as a second language, selected from a broader longitudinal study of one year’s duration. It was found that the learner’s word order development was identical to the natural development of German as a second language despite the progression intended in the teaching. A similar result was obtained in the development of verbal morphology. It is also shown that agreement marking is acquired at the same time as specific word order rules.


Sign in / Sign up

Export Citation Format

Share Document