Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Early Detection of Possible Undergraduate Drop Out Using a New Method Based on Probabilistic Rough Set Theory
RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.ORCID-id: 0000-0002-3460-2902
RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
2019 (engelsk)Inngår i: Uncertainty Management with Fuzzy and Rough Sets: Recent Advances and Applications / [ed] Bello, Rafael; Falcon, Rafael; Verdegay, José Luis, Springer International Publishing , 2019, s. 211-232Kapittel i bok, del av antologi (Annet vitenskapelig)
Abstract [en]

For any educational project, it is important and challenging to know, at the moment of enrollment, whether a given student is likely to successfully pass the academic year. This task is not simple at all because many factors contribute to college failure. Being able to infer how likely is an enrolled student to present promotions problems, is undoubtedly an interesting challenge for the areas of data mining and education. In this paper, we propose the use of data mining techniques in order to predict how likely a student is to succeed in the academic year. Normally, there are more students that success than fail, resulting in an imbalanced data representation. To cope with imbalanced data, we introduce a new algorithm based on probabilistic Rough Set Theory (RST). Two ideas are introduced. The first one is the use of two different threshold values for the similarity between objects when dealing with minority or majority examples. The second idea combines the original distribution of the data with the probabilities predicted by the RST method. Our experimental analysis shows that we obtain better results than a range of state-of-the-art algorithms.

sted, utgiver, år, opplag, sider
Springer International Publishing , 2019. s. 211-232
HSV kategori
Identifikatorer
URN: urn:nbn:se:ri:diva-37740DOI: 10.1007/978-3-030-10463-4_12Scopus ID: 2-s2.0-85061054020OAI: oai:DiVA.org:ri-37740DiVA, id: diva2:1287606
Tilgjengelig fra: 2019-02-11 Laget: 2019-02-11 Sist oppdatert: 2020-01-31bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopushttps://doi.org/10.1007/978-3-030-10463-4_12

Person

Ramentol, Enislay

Søk i DiVA

Av forfatter/redaktør
Ramentol, Enislay
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 66 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
v. 2.45.0