As the number of networked computers grows, intrusion detection is an essential component in keeping networks secure. Various approaches for intrusion detection are currently being in use with each one has its own merits and demerits. This paper presents our work to test and improve the performance of a new class of decision tree c-fuzzy decision tree to detect intrusion. The work also includes...

Decision trees have been widely used in machine learning. However, due to some reasons, data collecting in real world contains a fuzzy and uncertain form. The decision tree should be able to handle such fuzzy data. This paper presents a method to construct fuzzy decision tree. It proposes a fuzzy decision tree induction method in iris flower data set, obtaining the entropy from the distance bet...

In this paper, the concept of fuzzy local ω-language, Büchi fuzzy local ω-language are studied and we give some closure properties of fuzzy local ω-languages. We also establish relationship between deterministic fuzzy local automaton and fuzzy local ω-language. Further we show that every fuzzy regular ω-language is a projection of a Büchi fuzzy local ω-language.

Feature based similarity search is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high dimensional feature space which is indexed using a multidimensional data structure. Similarity search then corresponds to a range search over the data structure. Although several data structures have been proposed for feature indexing...

Decision trees have been widely used in machine learning. However, due to some reasons, data collecting in real world contains a fuzzy and uncertain form. The decision tree should be able to handle such fuzzy data. This paper presents a method to construct fuzzy decision tree. It proposes a fuzzy decision tree induction method in iris flower data set, obtaining the entropy from the distance bet...

Multidimensional aggregates are frequently computed to improve query performance in Online Analytical Processing applications. We present a new method for decision tree based classiication trees using the aggregates computed in the multidimensional data model. The structure imposed on data in a explicit multidimensional storage mechanism leads to eecient dimensional operations. Decision tree ba...

We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages are defined similarly as for ranked tree languages, and an unranked tree language is shown to be recognizable iff its syntactic algebra is regular, i.e., a ...

A word u ∈ A+ is an expletive for a fuzzy language λ if λ(xuy) = λ(xy) for all x, y ∈ A+. A full expletive fuzzy language is a fuzzy language in which the set of expletives is A+. Here we prove that the set of full expletive fuzzy languages is a variety and the associated pseudovariety of semigroups is that of midunit semigroups. Subject Classification: 20M35, 20M07, 68Q45