Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm

Almahdi Mohammed Ahmed, Azuraliza Abu Bakar, Abdul Razak Hamdan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper we propose a new approach to the dynamic data discretization technique. The technique is called Frequency Dynamic Interval Class (FDIC). FDIC consists of two important phases: The dynamic intervals class phase and the interval merging phase. The first phase uses a simple statistical frequency measure to obtain the initial intervals while in the second phase a K-Nearest Neighbour is used to calculate the merging factor for the unknown intervals. The experimental results showed that FDIC generates more intervals in an attribute, and less number rules with comparable accuracies within three tested datasets. It indicates that FDIC managed to reduce the loss of knowledge in several other techniques that generated the very least number of intervals.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages10-14
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Fingerprint

Merging

Keywords

  • Discretization
  • Dynamic intervals
  • KNN measures

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Ahmed, A. M., Abu Bakar, A., & Hamdan, A. R. (2009). Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 10-14). [5341919] https://doi.org/10.1109/DMO.2009.5341919

Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm. / Ahmed, Almahdi Mohammed; Abu Bakar, Azuraliza; Hamdan, Abdul Razak.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 10-14 5341919.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahmed, AM, Abu Bakar, A & Hamdan, AR 2009, Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341919, pp. 10-14, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341919
Ahmed AM, Abu Bakar A, Hamdan AR. Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 10-14. 5341919 https://doi.org/10.1109/DMO.2009.5341919
Ahmed, Almahdi Mohammed ; Abu Bakar, Azuraliza ; Hamdan, Abdul Razak. / Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 10-14
@inproceedings{71b840e00c064c69bcca3e54ca79e004,
title = "Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm",
abstract = "In this paper we propose a new approach to the dynamic data discretization technique. The technique is called Frequency Dynamic Interval Class (FDIC). FDIC consists of two important phases: The dynamic intervals class phase and the interval merging phase. The first phase uses a simple statistical frequency measure to obtain the initial intervals while in the second phase a K-Nearest Neighbour is used to calculate the merging factor for the unknown intervals. The experimental results showed that FDIC generates more intervals in an attribute, and less number rules with comparable accuracies within three tested datasets. It indicates that FDIC managed to reduce the loss of knowledge in several other techniques that generated the very least number of intervals.",
keywords = "Discretization, Dynamic intervals, KNN measures",
author = "Ahmed, {Almahdi Mohammed} and {Abu Bakar}, Azuraliza and Hamdan, {Abdul Razak}",
year = "2009",
doi = "10.1109/DMO.2009.5341919",
language = "English",
isbn = "9781424449446",
pages = "10--14",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Dynamic data discretization technique based on frequency and K-Nearest Neighbour algorithm

AU - Ahmed, Almahdi Mohammed

AU - Abu Bakar, Azuraliza

AU - Hamdan, Abdul Razak

PY - 2009

Y1 - 2009

N2 - In this paper we propose a new approach to the dynamic data discretization technique. The technique is called Frequency Dynamic Interval Class (FDIC). FDIC consists of two important phases: The dynamic intervals class phase and the interval merging phase. The first phase uses a simple statistical frequency measure to obtain the initial intervals while in the second phase a K-Nearest Neighbour is used to calculate the merging factor for the unknown intervals. The experimental results showed that FDIC generates more intervals in an attribute, and less number rules with comparable accuracies within three tested datasets. It indicates that FDIC managed to reduce the loss of knowledge in several other techniques that generated the very least number of intervals.

AB - In this paper we propose a new approach to the dynamic data discretization technique. The technique is called Frequency Dynamic Interval Class (FDIC). FDIC consists of two important phases: The dynamic intervals class phase and the interval merging phase. The first phase uses a simple statistical frequency measure to obtain the initial intervals while in the second phase a K-Nearest Neighbour is used to calculate the merging factor for the unknown intervals. The experimental results showed that FDIC generates more intervals in an attribute, and less number rules with comparable accuracies within three tested datasets. It indicates that FDIC managed to reduce the loss of knowledge in several other techniques that generated the very least number of intervals.

KW - Discretization

KW - Dynamic intervals

KW - KNN measures

UR - http://www.scopus.com/inward/record.url?scp=72449163495&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72449163495&partnerID=8YFLogxK

U2 - 10.1109/DMO.2009.5341919

DO - 10.1109/DMO.2009.5341919

M3 - Conference contribution

AN - SCOPUS:72449163495

SN - 9781424449446

SP - 10

EP - 14

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -