概念格

研究采用新的方法和手段来构造概念格，就成为概念格研究的主要内容之一。

It is one of the most important contents for the concept lattice technique to research the new methods and techniques of concept lattice construction .

概念格的分解算法：从概念格分解函数的定义出发，研究了把一个概念格分解为两个属性集相同的子概念格的方法。

A decomposition algorithm of concept lattice was discussed . From the definition of decomposition function , the algorithm of one concept lattice decomposed into sublattices with the same attributes set was researched .

基于概念格的Web日志路径挖掘算法

An Algorithm for Path Mining of Web Log Based on Concept Lattice

基于概念格的Web服务管理技术

Web services management based on concept lattice

以本体论和概念格理论为基础，提出一种基于语义Web服务相似度的功能匹配方法；

A novel approach based on ontology and concept lattice theories for semantic Web service similarity function matching is presented .

基于概念格的Java语言类层次分析研究与实现

Research and Implementation of the Class Hierarchy Analysis for Java Language Based on Concept Lattice

用概念格方法挖掘Aspect

Aspect Mining Using Concept Analysis

有序概念格与WWW用户访问模式的增量挖掘

An Ordered Concept Lattice and Incremental Discovery of User Traversal Patterns on the WWW

对模糊概念格去模糊化处理后，基于模糊概念格构建语义Web语言变量模糊本体，并使用OWL对其进行描述。

Semantic Web fuzzy ontology with linguistic variables is established based on fuzzy concept lattice after defuzzification , and is described with OWL .

基于概念格和Apriori的关联规则挖掘算法分析

Analysis of association rule mining algorithms based on the concept lattice and the Apriori algorithm

本文提出了一个基于序列模式挖掘的个性化技术，它使用概念格（conceptlattice）作为存储频繁序列的数据结构。

In this paper we present an sequential-pattern-based recommendation System , which extract usage patterns from web log file and use the concept lattice as its data structure storing frequent sequences .

论文研究了概念格的基础理论、概念格的构造算法，并对概念格的剪枝理论及其在Web挖掘中的应用展开了深入的研究。

This paper studied the basic theory of concept lattice , some kinds of the concept lattice construction algorithm , and study deeply on the purring theory of concept lattice and its application in web mining .

利用概念格方法构建语义Web本体具有结构上的唯一性和简明性等优点，所以如何构建概念格并将其应用在语义Web本体的构建上成为了研究热点。

The semantic Web ontology based on concept lattice has some advantages such as uniqueness and conciseness of the structure , so how to construct a concept lattice for constructing semantic Web ontology becomes a research hotspot .

以搜狗实验室提供的214篇交通类中文常用文本作为数据源，验证了语义Web中文本体构建的粗糙概念格方法的可行性和实用价值。

The feasibility and practical value of the method of building semantic Web Chinese ontology based on rough concept lattice are verified by using 214 Chinese texts in traffic classes from Sogou Labs as the data source .

FCA的一个重要问题是构造概念格。

One of important issues in FCA is construction of concept lattices .

实验表明，在符合实际应用的情况下，基于n阶形式背景核的概念格构造方法优于Godin算法。

Test shows that the method yields concept lattices in lower time complexity than Godin algorithm in actual case .

论文扩展了概念格理论，提出了趋势概念格的概念，并给出了高效的趋势概念格建格算法（CreateDecisionLattice算法）、与趋势有关的决策规则挖掘算法（FindRulesDecisionLattice算法）。

We extend the concept lattice theory , propose the concept of trend concept lattice , and give effective concept lattice construction algorithm ( CreateDecisionLattice ) . We also gives decision rules mining algorithm ( FindRules_DecisionLattice ) .

概念格扩展模型（ECL）适用于挖掘包括序列模式在内的各种知识。

The Extended model of Concept Lattice ( ECL ) is suitable to discover various knowledge including sequential patterns .

实际领域→粗糙概念格→中文本体，进而将之应用于支持更接近现实世界的语义Web的实际运行，是本论文的研究目标与技术路线。

Moreover the " practical domain → rough concept lattice → Chinese ontology " is applied to support the practical operation of the Semantic Web more closely to real-world , which is the research target and technical route of this paper .

扩展概念格是作者在Galois格中引入等价内涵关系而得到的一种扩展形式，并且已对其渐进式构造进行了研究。

Authors have presented Extended Concept Lattice by introducing equivalence relation between intensions to Galois Concept Lattice and studied its incremental algorithm .

在分析各类极化特征信息和目标之间的联系基础上，构建极化SAR分类形式背景下的概念格，利用生成的分类规则对地面目标进行分类研究。

After analyzing the link between Polarimetric characteristics information and the surface targets , this tool constructs the concept lattice of the Polarimetric classification formal content . And then , apply this mined classification rules in surface targets classification research .

深入分析了当前搜索系统存在的缺点，在Web文本检索中运用概念格理论挖掘文本中潜在的概念结构及概念间的相互关系，提出了一种基于概念格理论的Web文本检索方法。

The shortcoming which the search system exists at present has been analyzed in depth . In text retrieval , concept lattice theory is used to the text to excavate the potential concept structure and interrelation among the concept , a text retrieval method based on concept lattice is proposed .

给定一个形式背景就能在此基础上构造概念格，且构造出的概念格是唯一的。K-Means算法是目前应用最为广泛的一种基于划分的聚类算法。

For the given formal context , the concept lattice constructed must existed and be unique.K-Means algorithm is the most widely used clustering algorithm based on partition , to deal effectively with large text set .

然后运用有限概念格与Rough集理论相结合形成Rough有限概念格，蕴涵规则则由其特有的上、下近似运算得到，不需计算繁琐的频繁项目集。

The constrained concept lattice , together with the rough set theory , is then incorporated into the method to implement a new restricted rough lattice based implication rules discovery ( RRLIRD ) approach to interactively acquire the rules with the specific rough upper and lower approximation .

主要研究工作如下：第一提出了一种新的概念格结构：粗糙概念格RCL，及其构造方法。

The main research work are as follows : First , a new concept lattice structure : rough concept lattice RCL , and its constructor .

通过对目标系统执行信息进行概念格分析，该方法能够识别和抽取横切用例模型的系统方法调用集合，并利用统一建模语言中用例图的版型（stereotype）机制对它们进行模型重构和呈现。

With this approach , the execution profiles are analyzed in concept lattices , thus the invoked methods that traverse system use case models can be identified . Finally , these crosscutting concerns are reconstructed and represented with UML stereotype .

概念格理论，亦称形式概念分析，是德国数学家WilleR.于同一年提出的一种用于概念的发现，排序和显示的数据分析方法。

Concept lattice theory , also called formal concept analysis , proposed by Wille R. in the same year , is a method for data analysis used in finding ordering and displaying of concepts .

在利用概念格挖掘关联规则方面，本文首先将基于量化概念格的关联规则挖掘算法与Apriori算法进行比较与分析，说明了前者在时间和空间性能上的优势。

In mining association rules based on concept lattice , firstly it compares the algorithm of mining association rules based on quantitative concept lattice with Apriori algorithm , and shows the performance advantages on time and space of the first one .

在此基础上，实现了基于频繁概念格的序列模式发现算法SECLSP。

Based on the above algorithm , a FCL based sequential patterns mining algorithm ( SECLSP ) is implemented .

采用剪枝技术来消除构造过程中存在的冗余内涵比较，给出约束概念格渐进式构造算法PCCL。

An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process .