scholarly journals A Web Page Clustering Method Based on Formal Concept Analysis

Information ◽  
2018 ◽  
Vol 9 (9) ◽  
pp. 228 ◽  
Author(s):  
Zuping Zhang ◽  
Jing Zhao ◽  
Xiping Yan
Keyword(s):  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Web Pages ◽  
Web Page ◽  
Data Links ◽  
Web Page Clustering ◽  
The Web

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.

The construction of multi-granularity concept lattices

2020 ◽  
Vol 39 (3) ◽  
pp. 2783-2790
Author(s):  
Qian Hu ◽  
Ke-Yun Qin
Keyword(s):  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Mutual Transformation ◽  
Concept Lattices ◽  
Construction Methods ◽  
Formal Concepts ◽  
Transformation Methods

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.

The Method of Discover the Attributes' Sequences of Objects in the Formal Context

2013 ◽  
Vol 427-429 ◽  
pp. 2536-2539
Author(s):  
Xue Song Dai ◽  
Yuan Ma ◽  
Wen Xue Hong
Keyword(s):  
Equivalence Relation ◽  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Analysis Method ◽  
Analysis Theory

Formal context is one of the research contents of formal concept analysis theory. In concept lattice, the attributes of the object are equivalent and there is no hierarchy. Facing to this problem, the equivalence relation which is on the attributes' set is defined and the corresponding σ operation is proposed. On this basis, the structure method of attribute hierarchical diagram is presented and attributes' sequences of associated objects are obtained. This conclusion enriches and extends the analysis method of the formal context.

scholarly journals Three-Way Concept Analysis for Incomplete Formal Contexts

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Huilai Zhi ◽  
Hao Chao
Keyword(s):  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Binary Relations ◽  
Formal Concepts ◽  
Target Set ◽  
The Relationship ◽  
Negative Attributes

Recently, incomplete formal contexts have received more and more attention from the communities of formal concept analysis. Different from a complete context where the binary relations between all the objects and attribute are known, an incomplete formal context has at least a pair of object and attribute with a completely unknown binary relation. Partially known formal concepts use interval sets to indicate the incompleteness. Three-way formal concept analysis is capable of characterizing a target set by combining positive and negative attributes. However, how to describe target set, by pointing out what attributes it has with certainty and what attributes it has with possibility and what attributes it does not has with certainty and what attributes it does not has with possibility, is still an open problem. This paper combines the ideas of three-way formal concept analysis and partially known formal concepts and presents a framework of approximate three-way concept analysis. At first, approximate object-induced and attribute-induced three-way concept lattices are introduced, respectively. And then, the relationship between approximate three-way concept lattice and classical three-way concept lattice are investigated. Finally, examples are presented to demonstrate and verify the obtained results.

scholarly journals Detection Of Maximal Balanced Clique In Signed Networks Based On Improved Three-Way Concept Lattice and Modified Formal Concept Analysis

2021 ◽  
Author(s):  
Yixuan Yang ◽  
Doo-Soon Park ◽  
Fei Hao ◽  
Sony Peng ◽  
Min-Pyo Hong ◽  
...  
Keyword(s):  
Social Network ◽  
Formal Concept Analysis ◽  
Industrial Revolution ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Signed Networks ◽  
Social Network Structure ◽  
Real World Datasets

Abstract In the era of artificial intelligence including the fourth industrial revolution, social networks analyzing is a significant topic in big data analysis. Clique detection is a state-of-the-art technique in social network structure mining, which is widely used in a particular social network like signed network. There are positive and negative relationships in signed networks which detect not only cliques or maximal cliques but also maximal balanced cliques.In this paper, two algorithms have been addressed to the problems. First, we modify three-way concept lattice algorithm using a modified formal context and supplement formal context to obtain an object-induced three-way concept lattice (OE-concept) to detect the maximal balanced cliques. Second, in order to improve the cost of memory and efficiency, we modify formal concept analysis algorithm by using modified formal context combine with supplement formal context to find the maximal balance cliques. Additionally, we utilized four real-world datasets to test our proposed approaches as well as the running time in the experimental section.

Using Formal Concept Analysis and Rough Set Constructing the System of Semantic Web

2011 ◽  
Vol 58-60 ◽  
pp. 1664-1670
Author(s):  
Hong Sheng Xu ◽  
Rui Ling Zhang
Keyword(s):  
Semantic Web ◽  
Rough Set ◽  
Formal Concept Analysis ◽  
Rough Set Theory ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Great Promise ◽  
Formal Concept ◽  
Concept Lattices

Formal concept analysis (FCA) is based on a formalization of the philosophical understanding of a concept as a unit of thought constituted by its extent and intent. The rough set philosophy is founded on the assumption that with every object of the universe of discourse we associate some information. This paper deals with approaches to knowledge reduction in generalized consistent decision formal context. Finally, a new system model of semantic web based on FCA and rough set is proposed, which preserve more structural and featural information of concept lattice. In order to obtain the concept lattices with relatively less attributes and objects, we study the reduction of the concept lattices based on FCA and rough set theory. The experimental results indicate that this method has great promise.

Web Pages Mining Based on Terms and Formal Concept Analysis

2014 ◽  
Vol 981 ◽  
pp. 187-191
Author(s):  
Bo Yu ◽  
Deng Ju Yao ◽  
Guang Yi Tang
Keyword(s):  
Formal Concept Analysis ◽  
Research Work ◽  
Concept Analysis ◽  
Difficult Problem ◽  
Formal Concept ◽  
Web Pages ◽  
Mining System ◽  
Main Research ◽  
Galois Lattice ◽  
The Web

In the face of immense Web pages of WWW, how to extract valuable knowledge from the Internet is a difficult problem. The main research work of this paper was to apply FCA (Formal concept analysis) and Web terms on the Web representing the relationship between Web pages and web terms. We deeply studied how to apply Galois to Web page mining, and used the Java language to design the Web pages mining system. The system uses the constructed Galois lattice to extract potential knowledge of WWW. The results prove that the use of Galois Lattices and Web terms for Web pages mining is feasible.

Knowledge Representation Using Formal Concept Analysis

2014 ◽  
pp. 306-336 ◽  
Author(s):  
Ch. Aswani Kumar ◽  
Prem Kumar Singh
Keyword(s):  
Formal Concept Analysis ◽  
Lattice Structure ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Mathematical Framework ◽  
Formal Concepts ◽  
Conceptual Data ◽  
The Relationship

Introduced by Rudolf Wille in the mid-80s, Formal Concept Analysis (FCA) is a mathematical framework that offers conceptual data analysis and knowledge discovery. FCA analyzes the data, which is represented in the form of a formal context, that describe the relationship between a particular set of objects and a particular set of attributes. From the formal context, FCA produces hierarchically ordered clusters called formal concepts and the basis of attribute dependencies, called attribute implications. All the concepts of a formal context form a hierarchical complete lattice structure called concept lattice that reflects the relationship of generalization and specialization among concepts. Several algorithms are proposed in the literature to extract the formal concepts from a given context. The objective of this chapter is to analyze, demonstrate, and compare a few standard algorithms that extract the formal concepts. For each algorithm, the analysis considers the functionality, output, complexity, delay time, exploration type, and data structures involved.

Analyses of Asphalt Pavement Distresses Using Formal Concept Analysis (FCA)

2013 ◽  
Vol 723 ◽  
pp. 790-797
Author(s):  
Jia Ruey Chang ◽  
Hui Mi Hsu ◽  
Sao Jeng Chao
Keyword(s):  
Formal Concept Analysis ◽  
Asphalt Pavement ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Mathematical Tool ◽  
Surface Climate ◽  
Pavement Distresses ◽  
Conceptual Data

The literature has identified several possible causes of asphalt pavement distresses. Loadrelated distresses are apparent where the pavement has been overstressed by traffic loads applied to its surface. Climate/durabilityrelated distresses arise due to exposure to the environment. Otherrelated distresses are caused by actions not related to load or climate such as fuel spills or construction deficiencies. In this paper, information about fourteen asphalt pavement distresses frequently occurred on Taiwans pavements was surveyed, structured and explored using formal concept analysis (FCA) method. FCA is an important mathematical tool for conceptual data analysis and knowledge acquisition. By using FCA, the concept lattice of the formal context of asphalt pavement distresses was created and studied. Based on the concept lattice and association rules derived from FCA, the causes of asphalt pavement distresses were understood. The findings are consistent with the literature and actual conditions. This study provides alternative solutions to understand the causes of asphalt pavement distresses. This study also clearly shows that FCA is a useful method for further exploring and extending information on pavement distresses.

Neutrosophic three-way concept lattice and its application in conflict analysis

2021 ◽  
pp. 1-18
Author(s):  
Han Yang ◽  
Keyun Qin
Keyword(s):  
Data Analysis ◽  
Knowledge Discovery ◽  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Conflict Analysis ◽  
Neutrosophic Set ◽  
Formal Context ◽  
Formal Concept ◽  
Concept Lattices

The theory of three-way concept analysis has been developed into an effective tool for data analysis and knowledge discovery. In this paper, we propose neutrosophic three-way concept lattice by combining neutrosophic set with three-way concept analysis and present an approach for conflict analysis by using neutrosophic three-way concept lattice. Firstly, we propose the notion of neutrosophic formal context, in which the relationships between objects and attributes are expressed by neutrosophic numbers. Three pairs of concept derivation operators are proposed. The basic properties of object-induced and attribute-induced neutrosophic three-way concept lattices are examined. Secondly, we divide the neutrosophic formal context into three classical formal contexts and propose the notions of the candidate neutrosophic three-way concepts and the redundant neutrosophic three-way concepts. Two approaches of constructing object-induced (attribute-induced) neutrosophic three-way concept lattices are presented by using candidate, redundant and original neutrosophic three-way concepts respectively. Finally, we apply the neutrosophic formal concept analysis to the conflict analysis and put forward the corresponding optimal strategy and the calculation method of the alliance.

ATTRIBUTE REDUCTION OF CONCEPT LATTICE BASED ON IRREDUCIBLE ELEMENTS

2013 ◽  
Vol 11 (06) ◽  
pp. 1350046 ◽  
Author(s):  
TONG-JUN LI ◽  
MING-ZHI LI ◽  
YU GAO
Keyword(s):  
Formal Concept Analysis ◽  
Concept Lattice ◽  
Attribute Reduction ◽  
Concept Analysis ◽  
Formal Context ◽  
Formal Concept ◽  
Irreducible Elements

Attribute reduction of formal context is a crucial reseach issue in formal concept analysis. In this paper, based on the meet-irreducible elements and join-irreducible elements of concept lattice, two kinds of attribute reductions of formal context are proposed, which are called MI-attribute reduction and JI-attribute reduction. Subsequently, we discuss the relationships among them and two existing attribute reductions of formal context, lattice-based attribute reduction and granular reduction. Consequently, we find that the MI-attribute reduction and lattice-based attribute reduction are identical. For JI-attribute reduction, the judgement theorems of JI-consistent attribute sets are obtained. Finally, by using the discernibility attribute sets, a method of computing all JI-attribute reducts of a formal context is presented.

Sign in / Sign up

Export Citation Format

Share Document