The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining Workshops (2013)
Dec. 7, 2013 to Dec. 10, 2013
pp: 735-741
In the last few years, chance discovery as an extension of data mining has been proposed to capture rare but significant chances from a single document data for human decision making. Key Graph is a useful miner algorithm as well as a tool to discover chance candidates. On base of that, Idea Graph extended the concept of a chance to uncover more valuable chances. However, Key Graph and Idea Graph both fail to consider semantic relations among terms. In this paper, we propose an improved algorithm called Idea Graph plus which makes use of semantic information to enhance the performance of scenario construction using LDA topic model. Additionally, the term overlaps between sub-scenarios provide a thinking space for human to perceive unnoticed chances. An experiment demonstrates the superiority of Idea Graph plus by comparing with Idea Graph.
Semantics, Clustering algorithms, Heuristic algorithms, Data mining, Cognition, Keyboards, Merging

C. Zhang, H. Wang, F. Xu and X. Hu, "IdeaGraph Plus: A Topic-Based Algorithm for Perceiving Unnoticed Events," 2013 IEEE 13th International Conference on Data Mining Workshops(ICDMW), TX, USA USA, 2013, pp. 735-741.
94 ms
(Ver 3.3 (11022016))