Learning probabilistic relational concept descriptions [microform]
- Bib ID:
- 3283589
- Format:
- Book and Microform
- Author:
- Ali, Kamal Mahmood
- Description:
- 224 p.
- Summary:
-
This dissertation presents methods for increasing the accuracy of probabilistic classification rules learned from noisy, relational data. It addresses the problem of learning probabilistic rules in noisy, "real-world" data sets, the problem of "small disjuncts" in which rules that apply to rare subclasses have high error rates, and the problems that arise in domains in which the learning algorithm is forced to pick from many rules that appear to be equally good. It is shown that learning a class description for each class in the data--the one-per-class approach--and attaching probabilistic estimates to the learned rules allows accurate classifications to be made on real-world data sets. The thesis presents the system HYDRA which implements this approach. It is shown that the resulting classifications are often more accurate than those made by three major methods for learning from noisy, relational data.
Furthermore, the learned rules are relational and so are more expressive than the attribute-value rules learned by most induction systems. Several results are also presented in the arena of multiple models. The multiple models approach is relevant to the problem of making accurate classifications in "real-world" domains since it facilitates evidence combination which is needed to accurately learn on such domains. The most important result of the multiple models research is that the amount of error reduction afforded by the multiple models approach is linearly correlated with the degree to which the individual models make errors in an uncorrelated manner. It is shown that it is possible to learn models that make less correlated errors in domains in which there are many gain ties.
The third major result of the research on multiple models is the realization that models should be learned that make errors in a negatively-correlated manner rather than those that make errors in an uncorrelated manner. Finally, results are presented on the small-disjuncts problem in which rules that apply to rare subclasses have high error rates. It is shown that the one-per-class approach reduces error rates for such rare rules while not sacrificing the error rates of the other rules.
- Notes:
-
- (UnM)AAI9612058
- Source: Dissertation Abstracts International, Volume: 56-12, Section: B, page: 6852.
- Chair: Michael J. Pazzani.
- Thesis (Ph.D.)--University of California, Irvine, 1996.
- Reproduction:
- Microfiche. Ann Arbor, Mich.: University Microfilms International.
- Subject:
- Other authors/contributors:
- University of California, Irvine
- Copyright:
-
In Copyright
Contact us for information about copying.
Copyright status was determined using the following information:
- Material type:
- Literary Dramatic Musical
- Published status:
- Unpublished
- Creation date:
- 1996
Copyright status may not be correct if data in the record is incomplete or inaccurate. Other access conditions may also apply. For more information please see: Copyright in library collections.
Request this item
Request this item to view in the Library’s reading room.