Refining Discretizations of Continuous-Valued Attributes

نویسندگان

  • Eva Armengol
  • Àngel García-Cerdaña
چکیده

The Rand index is a measure commonly used to compare crisp partitions. Campello (2007) and Hüllermeier and Rifqi (2009) respectively, proposed two extensions of this index capable to compare fuzzy partitions. These approaches are useful when continuous values of attributes are discretized using fuzzy sets. In previous works we experimented with these extensions and compared their accuracy with the one of the crisp Rand index. In this paper we propose the ε-procedure, an alternative way to deal with attributes taking continuous values. Accuracy results on some known datasets of the Machine Learning repository using the ε-procedure as crisp discretization method jointly with the crisp Rand index are comparable to the ones given using the crisp Rand index and its fuzzifications with standard crisp and fuzzy discretization methods respectively.

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

ثبت نام

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

منابع مشابه

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Discretization of Continuous-valued Attributes and Instance-based Learning

Recent work on discretization of continuous-valued attributes in learning decision trees has produced some positive results. This paper adopts the idea of discretization of continuous-valued attributes and applies it to instance-based learning (Aha, 1990; Aha, Kibler & Albert, 1991). Our experiments have shown that instance-based learning (IBL) usually performs well in continuous-valued attribu...

متن کامل

Countable composition closedness and integer-valued continuous functions in pointfree topology

‎For any archimedean$f$-ring $A$ with unit in whichbreak$awedge‎ ‎(1-a)leq 0$ for all $ain A$‎, ‎the following are shown to be‎ ‎equivalent‎: ‎ ‎1‎. ‎$A$ is isomorphic to the $l$-ring ${mathfrak Z}L$ of all‎ ‎integer-valued continuous functions on some frame $L$‎. 2‎. ‎$A$ is a homomorphic image of the $l$-ring $C_{Bbb Z}(X)$‎ ‎of all integer-valued continuous functions‎, ‎in the usual se...

متن کامل

An Evolutionary Algorithm Integrating Discretization of Continuous-valued Attributes with Learning Decision Rules

A new method of learning decision rules from databases, which uses an evolutionary algorithm, is proposed. The main diierence between our approach and the others described in the literature is the way of processing of continuous-valued attributes. Most decision rule learners process separately these attributes when searching for threshold values, which may decrease the performance. In contrast ...

متن کامل

Pointfree topology version of image of real-valued continuous functions

Let $ { mathcal{R}} L$ be the ring of real-valued continuous functions on a frame $L$ as the pointfree  version of $C(X)$, the ring of all real-valued continuous functions on a topological space $X$. Since $C_c(X)$ is the largest subring of $C(X)$ whose elements have countable image, this motivates us to present the pointfree  version of $C_c(X).$The main aim of this paper is to present t...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012