In:
ACM Transactions on Knowledge Discovery from Data, Association for Computing Machinery (ACM), Vol. 2, No. 1 ( 2008-03), p. 1-30
Abstract:
Mining frequent patterns from large datasets is an important issue in data mining. Recently, complex and unstructured (or semi-structured) datasets have appeared as targets for major data mining applications, including text mining, web mining and bioinformatics. Our work focuses on labeled ordered trees, which are typically semi-structured datasets. In bioinformatics, carbohydrate sugar chains, or glycans, can be modeled as labeled ordered trees. Glycans are the third major class of biomolecules, having important roles in signaling and recognition. For mining labeled ordered trees, we propose a new probabilistic model and its efficient learning scheme which significantly improves the time and space complexity of an existing probabilistic model for labeled ordered trees. We evaluated the performance of the proposed model, comparing it with those of other probabilistic models, using synthetic as well as real datasets from glycobiology. Experimental results showed that the proposed model drastically reduced the computation time of the competing model, keeping the predictive power and avoiding overfitting to the training data. Finally, we assessed our results on real data from a variety of biological viewpoints, verifying known facts in glycobiology.
Type of Medium:
Online Resource
ISSN:
1556-4681
,
1556-472X
DOI:
10.1145/1342320.1342326
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2008
detail.hit.zdb_id:
2257358-6
Permalink
