CLASSIFYING TWO CLASS DATA USING HYPER RECTANGLE PARALLEL TO THE COORDINATE AXES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOSLEHI ZAHRA; PALHANG MAZIAR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY Year:2016 | Volume:7 | Issue:25-26 Page(s): 1-13

Download Full-Text

Persian Verion

View:

676

Download:

Cites:

Information Journal Paper

Title

CLASSIFYING TWO CLASS DATA USING HYPER RECTANGLE PARALLEL TO THE COORDINATE AXES

Author(s)

MOSLEHI ZAHRA | PALHANG MAZIAR | Issue Writer Certificate

Keywords

MACHINE LEARNINGQ2

CLASSIFICATIONQ2

DECISION TREESQ2

COMPUTATIONAL GEOMETRYQ2

SEPARABILITYQ2

HYPER RECTANGLEQ2

Abstract

One of the MACHINE LEARNING tasks is supervised learning. In supervised learning we infer a function from labeled training data. The goal of supervised learning algorithms is learning a good hypothesis that minimizes the sum of the errors. A wide range of supervised algorithms is available such as decision tress, SVM, and KNN methods. In this paper we focus on decision tree algorithms. When we use the decision tree algorithms, the data is partitioned by axis- aligned hyper planes. The geometric concept of decision tree algorithms is relative to SEPARABILITY problems in COMPUTATIONAL GEOMETRY. One of the famous problems in SEPARABILITY concept is computing the maximum bichromatic discrepancy problem. There exists an -time algorithm to compute the maximum bichromatic discrepancy in d dimensions. This problem is closely relative to DECISION TREES in MACHINE LEARNING. We implement this problem in 1, 2, 3 and d dimension. Also, we implement the C4.5 algorithm. The experiments showed that results of this algorithm and C4.5 algorithm are comparable.

Cites

No record.

References

No record.

Cite

APA: Copy

MOSLEHI, ZAHRA, & PALHANG, MAZIAR. (2016). CLASSIFYING TWO CLASS DATA USING HYPER RECTANGLE PARALLEL TO THE COORDINATE AXES. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, 7(25-26), 1-13. SID. https://sid.ir/paper/171471/en

Vancouver: Copy

MOSLEHI ZAHRA, PALHANG MAZIAR. CLASSIFYING TWO CLASS DATA USING HYPER RECTANGLE PARALLEL TO THE COORDINATE AXES. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY[Internet]. 2016;7(25-26):1-13. Available from: https://sid.ir/paper/171471/en

IEEE: Copy

ZAHRA MOSLEHI, and MAZIAR PALHANG, “CLASSIFYING TWO CLASS DATA USING HYPER RECTANGLE PARALLEL TO THE COORDINATE AXES,” IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, vol. 7, no. 25-26, pp. 1–13, 2016, [Online]. Available: https://sid.ir/paper/171471/en

Related Journal Papers