In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Incorporating background knowledge into data mining algorithms is an important but challenging problem. Current approaches in semi-supervised learning require explicit knowledge p...
Samah Jamal Fodeh, William F. Punch, Pang-Ning Tan
Paraphrase recognition is a critical step for natural language interpretation. Accordingly, many NLP applications would benefit from high coverage knowledge bases of paraphrases. ...
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...