• Korean Journal of Mathematics
• /
• v.26 no.3
• /
• pp.503-517
• /
• 2018

Keeping in view the expediency of soft sets in algebraic structures and as a mathematical approach to vagueness, in this paper the concept of lattice ordered soft near rings is introduced. Different properties of lattice ordered soft near rings by using some operations of soft sets are investigated. The concept of idealistic soft near rings with respect to lattice ordered soft near ring homomorphisms is deliberated.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.189-202
• /
• 2023

In the era marked by information inundation, social network analysis is the most important part of big data analysis, with clique detection being a key technology in social network mining. Also, detecting maximal balance clique in signed networks with positive and negative relationships is essential. In this paper, we present two algorithms. The first one is an algorithm, MCDA1, that detects the maximal balance clique using the improved three-way concept lattice algorithm and object-induced three-way concept lattice (OE-concept). The second one is an improved formal concept analysis algorithm, MCDA2, that improves the efficiency of memory. Additionally, we tested the execution time of our proposed method with four real-world datasets.

• Genomics & Informatics
• /
• v.11 no.1
• /
• pp.38-45
• /
• 2013

In cancer genome studies, the annotation of newly detected oncogene/tumor suppressor gene candidates is a challenging process. We propose using concept lattice analysis for the annotation and interpretation of genes having candidate somatic mutations in whole-exome sequencing in acute myeloid leukemia (AML). We selected 45 highly mutated genes with whole-exome sequencing in 10 normal matched samples of the AML-M2 subtype. To evaluate these genes, we performed concept lattice analysis and annotated these genes with existing knowledge databases.

• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.479-493
• /
• 2010

Along with the transformation of the knowledge-based environment, e-learning has become a main teaching and learning method, prompting various research efforts to be conducted in this field. One major research area in e-learning involves adaptive learning systems that provide personalized learning content according to each learner's characteristics by taking into consideration a variety of learning circumstances. Active research on ontology-based adaptive learning systems has recently been conducted to provide more efficient and adaptive learning content. In this paper, we design and propose an adaptive learning system based on the concept lattice of Formal Concept Analysis (FCA) with the same objectives as those of ontology approaches. However, we are in pursuit of a system that is suitable for learning of specific domains and one that allows users to more freely and easily build their own adaptive learning systems. The proposed system automatically classifies the learning objects and concepts of an evolved domain in the structure of a concept lattice based on the relationships between the objects and concepts. In addition, the system adaptively constructs and presents the learning structure of the concept lattice according to each student's level of knowledge, learning style, learning preference and the learning state of each concept.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.184-204
• /
• 2015

Fuzzy Formal Concept Analysis (FCA) is a mathematical tool for the effective representation of imprecise and vague knowledge. However, with a large number of formal concepts from a fuzzy context, the task of knowledge representation becomes complex. Hence, knowledge reduction is an important issue in FCA with a fuzzy setting. The purpose of this current study is to address this issue by proposing a method that computes the corresponding crisp order for the fuzzy relation in a given fuzzy formal context. The obtained formal context using the proposed method provides a fewer number of concepts when compared to original fuzzy context. The resultant lattice structure is a reduced form of its corresponding fuzzy concept lattice and preserves the specialized and generalized concepts, as well as stability. This study also shows a step-by-step demonstration of the proposed method and its application.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.184-200
• /
• 2020

Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.

• Structural Engineering and Mechanics
• /
• v.37 no.6
• /
• pp.617-632
• /
• 2011

A concept of crash energy absorbing (CEA) lattice structure for an inflatable morphing vehicle body (Lee et al. 2008) has been investigated as a method of providing rigidity and energy absorption capability during a vehicular collision (Lee et al. 2007). A modified analytical model for the CEA lattice structure design is described in this paper. The modification of the analytic model was made with a stiffness approach for the elastic region and updated plastic limit analysis with a pure plastic bending deformation concept and amended elongation factors for the plastic region. The proposed CEA structure is composed of a morphing lattice structure with movable thin-walled members for morphing purposes, members that will be locked in designated positions either before or during the crash. What will be described here is how to model the CEA structure analytically based on the energy absorbed by the CEA structure.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.193-198
• /
• 1997

In order to research the logical system whose propositional value is given in a lattice, Y. Xu [4] proposed the concept of lattice implication algebras, and discussed their some properties in [3] and [4]. Y. Xu and K. Qin [5] introduced the notions of filter and implicative filter in a lattice implication algebra, and investigated their properties. In this paper, in the first place, we give an equivalent condition of a filter, and provide some equivalent conditions that a filter is an implicative filter in a lattice implication algebra. By using these results, we construct an extension property for implicative filter.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.163-178
• /
• 2005

The ultimate objective of Personal Information Management (PIM) is to collect, handle and manage wanted information in a systematic way that enables individuals to search the information more easily and effectively, However, existing personal information management systems are usually based on a traditional hierarchical directory model for storing information, limiting effective organization and retrieval of information as well as providing less support in search by associative interrelationship between objects (documents) and their attributes, To improve these problems, in this paper we propose a personal information management model based on the concept lattice of Formal Concept Analysis (FCA) to easily build and maintain individuals' own information on the Web, The proposed system can overcome the limitations of the traditional hierarchy approach as well as supporting search of other useful information by the inter-relationships between objects and their attributes in the concept lattice of FCA beyond a narrow search.

• Honam Mathematical Journal
• /
• v.40 no.3
• /
• pp.457-486
• /
• 2018

In several fields the soft set theory has a very vast range uses and applications. A soft group is a proper family of subgroups and a fuzzy soft group is a proper family of fuzzy subgroups. Here in this paper the concept of lattice ordered fuzzy soft groups is introduced. Also its some properties are studied and discussed. In addition, the defintion of lattice order fuzzy soft right (left) cosets and lattice order soft product of fuzzy soft subgroups and some related results are discussed to clear these ideas.