A new supervised term ranking method for text categorization
- Authors: Mammadov, Musa , Yearwood, John , Zhao, Lei
- Date: 2010
- Type: Text , Conference paper
- Relation: Paper presented at 23rd Australasian Joint Conference on Artificial Intelligence, AI 2010 Vol. 6464 LNAI, p. 102-111
- Full Text:
- Reviewed:
- Description: In text categorization, different supervised term weighting methods have been applied to improve classification performance by weighting terms with respect to different categories, for example, Information Gain, χ2 statistic, and Odds Ratio. From the literature there are three term ranking methods to summarize term weights of different categories for multi-class text categorization. They are Summation, Average, and Maximum methods. In this paper we present a new term ranking method to summarize term weights, i.e. Maximum Gap. Using two different methods of information gain and χ2 statistic, we setup controlled experiments for different term ranking methods. Reuter-21578 text corpus is used as the dataset. Two popular classification algorithms SVM and Boostexter are adopted to evaluate the performance of different term ranking methods. Experimental results show that the new term ranking method performs better. © 2010 Springer-Verlag.
Learning parse-free event-based features for textual entailment recognition
- Authors: Ofoghi, Bahadorreza , Yearwood, John
- Date: 2010
- Type: Text , Conference paper
- Relation: Paper presented at 23rd Australasian Joint Conference on Artificial Intelligence, AI 2010 Vol. 6464 LNAI, p. 184-193
- Full Text: false
- Reviewed:
- Description: We propose new parse-free event-based features to be used in conjunction with lexical, syntactic, and semantic features of texts and hypotheses for Machine Learning-based Recognizing Textual Entailment. Our new similarity features are extracted without using shallow semantic parsers, but still lexical and compositional semantics are not left out. Our experimental results demonstrate that these features can improve the effectiveness of the identification of entailment and no-entailment relationships. © 2010 Springer-Verlag.
A hybrid question answering schema using encapsulated semantics in lexical resources
- Authors: Ofoghi, Bahadorreza , Yearwood, John , Ghosh, Ranadhir
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at Artificial Intelligence, AI 2006: Advances in Artificial Intelligence, Hobart : 4th December, 2006 p. 1276-1280
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001531
Visualizing association rules for feedback within the legal system
- Authors: Ivkovic, Sasha , Yearwood, John , Stranieri, Andrew
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the 9th International Conference on Artificial Intelligence and Law, Edinburgh, Scotland : 24th - 28th June, 2003
- Full Text: false
- Reviewed:
- Description: Knowledge discovery from databases (KDD) exercises in law have typically attempted to derive knowledge about decision making processes in the legal domain automatically from datasets. This is made difficult in that real data that represents aspects of a decision process in law is commonly stored as text and rarely stored in structured databases. The central claim advanced here is that KDD processes can be usefully applied to existing datasets of client and demographic data in order to provide feedback for the effective operation of organizations within the legal system. However, the cost of data mining suites and the scarcity of specialized personnel for these tools mitigates against their use. In this study data mining with Association Rules (AR) has been performed on a data-set of over 380,000 records from a legal aid agency. Methods to visualise patterns in order to suggest and test plausible hypotheses from the data have been developed. The tool, called WebAssociate is entirely web based. Domain experts using the tool report favorable responses.
- Description: E1
- Description: 2003000495