关键词: 领域知识, 知识库, 数据清洗, 海量数据

Abstract: By analyzing the limitation of traditional structures of knowledge base，an extended tree-like knowledge base is built by decomposing and recomposing the domain knowledge.The leaf node of the tree is linked with the knowledge instance called atomic knowledge and the non-leaf node is linked with the concept of knowledge.Based on the knowledge base，a data cleaning algorithm is proposed.It extracts atomic knowledge of the selected nodes firstly，then analyzes their relations，deletes the same objects，builds an atomic knowledge sequence based on weights，lastly cleans data according to the sequence.The experiment shows that the count of scaning mass data can be reduced rapidly by adopting the algorithm to optimize the users’ requests and the data cleaning efficiency can be improved clearly.

Key words: domain knowledge, knowledge base, data cleaning, mass data