Skip to main content

2018 | OriginalPaper | Buchkapitel

Exploiting Domain-Experts Knowledge Within an Evidential Process for Case Base Maintenance

verfasst von : Safa Ben Ayed, Zied Elouedi, Eric Lefevre

Erschienen in: Belief Functions: Theory and Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Case Base Maintenance (CBM) presents one of the key factors success for Case Based Reasoning (CBR) systems. Thence, several CBM policies are proposed to improve their problem-solving performance and competence. However, to the best of our knowledge, all of them are not able to make use of prior knowledge which can be offered by domain experts, especially that CBR is widely applied in real-life domains. For instance, given symptoms of two different cases in medicine area, the doctor can affirm that these two cases should never follow the same treatment, or conversely. This kind of prior knowledge is presented in form of Cannot-Link and Must-link constraints. In addition, most of them cannot manage uncertainty in cases during CBM. To overcome this shortcoming, we propose, in this paper, a CBM policy that handles constraints to exploit experts’ knowledge during case base learning along with managing uncertainty using the belief function theory. This new CBM approach consists mainly in noisy and redundant cases deletion.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Aamodt, A., Plaza, E.: Case-based reasoning: foundational issues, methodological variations, and system approaches. In: AI Communications, pp. 39–59. IOS Press (1994) Aamodt, A., Plaza, E.: Case-based reasoning: foundational issues, methodological variations, and system approaches. In: AI Communications, pp. 39–59. IOS Press (1994)
2.
Zurück zum Zitat Wilson, D.C., Leake, D.B.: Maintaining case-based reasoners: dimensions and directions. In: Computational Intelligence, pp. 196–213 (2001) Wilson, D.C., Leake, D.B.: Maintaining case-based reasoners: dimensions and directions. In: Computational Intelligence, pp. 196–213 (2001)
4.
Zurück zum Zitat Ben Ayed, S., Elouedi, Z., Lefevre, E.: ECTD: evidential clustering and case types detection for case base maintenance. In: International Conference on Computer Systems and Applications, pp. 1462–1469. IEEE (2017) Ben Ayed, S., Elouedi, Z., Lefevre, E.: ECTD: evidential clustering and case types detection for case base maintenance. In: International Conference on Computer Systems and Applications, pp. 1462–1469. IEEE (2017)
5.
Zurück zum Zitat Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 577–584 (2001) Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 577–584 (2001)
6.
Zurück zum Zitat Antoine, V., Quost, B., Masson, M., Denoeux, T.: CECM: constrained evidential c-means algorithm. Comput. Stat. Data Anal. 56, 894–914 (2012)MathSciNetCrossRef Antoine, V., Quost, B., Masson, M., Denoeux, T.: CECM: constrained evidential c-means algorithm. Comput. Stat. Data Anal. 56, 894–914 (2012)MathSciNetCrossRef
8.
Zurück zum Zitat Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976) Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)
9.
Zurück zum Zitat Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38, 325–339 (1967)MathSciNetCrossRef Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38, 325–339 (1967)MathSciNetCrossRef
10.
Zurück zum Zitat Masson, M.H., Denoeux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Patt. Recogn. 41, 1384–1397 (2008)CrossRef Masson, M.H., Denoeux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Patt. Recogn. 41, 1384–1397 (2008)CrossRef
Metadaten
Titel
Exploiting Domain-Experts Knowledge Within an Evidential Process for Case Base Maintenance
verfasst von
Safa Ben Ayed
Zied Elouedi
Eric Lefevre
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-99383-6_4

Premium Partner