Using LSI for text classification in the presence of background text
Proceedings of the tenth international conference on Information and knowledge management
Machine learning in automated text categorization
ACM Computing Surveys (CSUR)
Modern Information Retrieval
Integrating Background Knowledge into Nearest-Neighbor Text Classification
ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
CBR for Document Retrieval: The FALLQ Project
ICCBR '97 Proceedings of the Second International Conference on Case-Based Reasoning Research and Development
Sophia: a novel approach for textual case-based reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Combining case-based and model-based reasoning for predicting the outcome of legal cases
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Divergence measures based on the Shannon entropy
IEEE Transactions on Information Theory
Business failure prediction using hybrid2 case-based reasoning (H2CBR)
Computers and Operations Research
Adaptive case-based reasoning using retention and forgetting strategies
Knowledge-Based Systems
Robust Regulation Adaptation in Multi-Agent Systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
NLP-based faceted search: Experience in the development of a science and technology search engine
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, we present a novel textual case-based reasoning system called SOPHIA-TCBR which provides a means of clustering semantically related textual cases where individual clusters are formed through the discovery of narrow themes which then act as attractors for related cases. During this process, SOPHIA-TCBR automatically discovers appropriate case and similarity knowledge. It then is able to organize the cases within each cluster by forming a minimum spanning tree, based on their semantic similarity. SOPHIA's capability as a case-based text classifier is benchmarked against the well known and widely utilised k-Means approach. Results show that SOPHIA either equals or outperforms k-Means based on 2 different case-bases, and as such is an attractive approach for case-based classification. We demonstrate the quality of the knowledge discovery process by showing the high level of topic similarity between adjacent cases within the minimum spanning tree. We show that the formation of the minimum spanning tree makes it possible to identify a kernel region within the cluster, which has a higher level of similarity between cases than the cluster in its entirety, and that this corresponds directly to a higher level of topic homogeneity. We demonstrate that the topic homogeneity increases as the average semantic similarity between cases in the kernel increases. Finally having empirically demonstrated the quality of the knowledge discovery process in SOPHIA, we show how it can be competently applied to case-based retrieval.