Domain Knowledge in Text Mining:Opportunities and Challenges

doi:10.3969/j.issn.1007130X.2010.

J4 ›› 2010, Vol. 32 ›› Issue (6): 88-91.doi: 10.3969/j.issn.1007130X.2010.

• 论文 • Previous Articles Next Articles

Domain Knowledge in Text Mining:Opportunities and Challenges

JING Liping,YUN Jiali,YU Jian

（School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China）

Received:2009-09-06 Revised:2009-12-10 Online:2010-06-01 Published:2010-06-01

Abstract

Abstract:

Recently, more and more researchers realize that it is hard to satisfy the users’ needs of the datadriven unsupervised learning methods in text data analysis. Fortunately, the appearance of domain knowledge provides a bright future for this problem. Domain knowledge, at present, is usually represented as ontology hierarchy (built artificially) or encyclopedia (e.g., online Wikipedia). In this paper, we describe how the domain knowledge is used in processing text mining, review the related work,and point out the challenges in this research direction.

Key words: domain knowledge;text mining;knowledge representation;text representation model

CLC Number:

TP18

JING Liping,YUN Jiali,YU Jian. Domain Knowledge in Text Mining:Opportunities and Challenges[J]. J4, 2010, 32(6): 88-91.

[1]	FANG Xi,MA Jianzhu,WANG Maoguang,JIAO Wenpin. An Approach to the Automated Integration of MultiAgent Systems Based on TwoWay Selections [J]. J4, 2010, 32(6): 68-73.
[2]	PAN Xiaoying. Dynamics Analysis of the MultiAgent Social Evolutionary Algorithm [J]. J4, 2010, 32(6): 74-76.
[3]	LIU Yubin1,ZHANG Wei1,TONG Xiangrong1,DONG Hongbin2. An Agent MultiIssue Negotiation Model Based on MultiObjective Planning [J]. J4, 2010, 32(6): 85-87.
[4]	DING Hao1，DING Shifei1,2，HU Lihua1. Research Progress of Attribute Reduction Based on Rough Sets [J]. J4, 2010, 32(6): 92-94.
[5]	LI Junjin,XIANG Yang,NIU Peng. A Dissonant Particle Swarm Algorithm for Data Mining [J]. J4, 2010, 32(6): 95-98.
[6]	LEI Hongyan,ZOU Hanbin. A Directional Fuzzy Clustering Algorithm with Rough Sets [J]. J4, 2010, 32(6): 99-102.
[7]	LIU Xiaoliang1,DING Shifei1,2,ZHU Hong1,ZHANG Liwen1. Appropriateness in Applying SVMs to Text Classification [J]. J4, 2010, 32(6): 106-108.
[8]	ZHAN Yubin，YIN Jianping，LIU Xinwang. A Kernel PCA View of the Local Tangent Space Alignment Algorithm [J]. J4, 2010, 32(6): 158-161.
[9]	LIU Jinglei,ZHANG Zhenrong,ZHANG Wei. Optimal Coalition Structure Solving Based on the Bipartite of Integer [J]. J4, 2010, 32(5): 64-66.
[10]	CHEN Yuwu1,CAO Jian1,LI Minglu1,ZHAO Haiyan2. An Algorithm for Coalition Formation with Complex Tasks [J]. J4, 2010, 32(5): 74-78.
[11]	LIU Xiaoyong. Text Clustering Algorithm with Ant Colony Based on the Best Solution Kept [J]. J4, 2010, 32(5): 79-81.
[12]	YUAN Hao. A Rough Set Attribute Reduction Method Based on the Quantum Ant Colony Algorithm [J]. J4, 2010, 32(5): 82-84.
[13]	XIE Mingxia1,2，GUO Jianzhong1，ZHANG Haibo3，CHEN Ke1. Research on the Similarity Measurement of High Dimensional Data [J]. J4, 2010, 32(5): 92-96.
[14]	CHEN Fengjuan,SUN Jing. Absolute Reduction in the Information View of Rough Sets [J]. J4, 2010, 32(5): 97-99.
[15]	LI Yuequn，MAO Wenji，WANG Feiyue. Causal Knowledge Extraction Based on Open Source Domain Texts [J]. J4, 2010, 32(5): 100-104.

Domain Knowledge in Text Mining:Opportunities and Challenges

PDF

Knowledge

Abstract

Cite this article

share this article

Related Articles 15

Recommended Articles

Metrics

Comments