Referenced Items are not available for this document.
In this paper, an algorithm of learning computational verb decision trees (verb trees, for short) from training examples base on impact factors, which are calculated by using computational verb similarities, is presented. Some examples are used to show the creation of verb decision tree and the usefulness of verb decision trees. Examples are used to show that verb decision trees are powerful tools to generalize and extract knowledge from both historical records and Boolean logical records.
Published in:
Anti-Counterfeiting Security and Identification in Communication (ASID), 2010 International Conference on
Date of Conference: 18-20 July 2010
- Page(s):
- 273 - 276
- Print ISBN:
- 978-1-4244-6731-0
- INSPEC Accession Number:
- 11487501
- Conference Location :
- Chengdu
- Digital Object Identifier :
- 10.1109/ICASID.2010.5551334
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
