Decision lists over regular patterns

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Decision Lists over Tree Patterns and Its Application

This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree structured objects. The learnability of this class is studied within the framework of the Probably Approximately Correct learning model and the Identi cation in the Limit model. It is found that the class k-node-DLRTP, a sub...

متن کامل

Lists of Face-Regular Polyhedra

We introduce a new notion that connects the combinatorial concept of regularity with the geometrical notion of face transitivity. This new notion implies finiteness results in the case of bounded maximal face size. We give lists of structures for some classes and investigate polyhedra with constant vertex degrees and faces of only two sizes.

متن کامل

Monotone term decision lists

We introduce a new representation class of Boolean functions|monotone term decision lists|which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. We study the learnability of monotone term decision l...

متن کامل

Decision Lists for Lexical Ambiguityresolution

This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collo-cational evidence, generating an eecient, eeective, and highly perspicuous recipe for resolving a given ambiguity. By identifying and utilizing only the single best dis-ambiguating evidence in a target context, the algorithm avoids th...

متن کامل

Pruning Decision Trees and Lists

Machine learning algorithms are techniques that automatically build models describing the structure at the heart of a set of data. Ideally, such models can be used to predict properties of future data points and people can use them to analyze the domain from which the data originates. Decision trees and lists are potentially powerful predictors and embody an explicit representation of the struc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00419-x