Stakeholder Conflict Resolution Model (S-CRM) Based On Supervised Learning
- Authors
- Jeon, Chang-Kyun; Kim, Neung-Hoe; Lee, Dong-Hyun; Lee, Taek; In, Hoh Peter
- Issue Date
- 30-11월-2012
- Publisher
- KSII-KOR SOC INTERNET INFORMATION
- Keywords
- Stakeholder; conflicts; requirements engineering; entropy; information gain
- Citation
- KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.6, no.11, pp.2813 - 2826
- Indexed
- SCIE
SCOPUS
KCI
OTHER
- Journal Title
- KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS
- Volume
- 6
- Number
- 11
- Start Page
- 2813
- End Page
- 2826
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/106910
- DOI
- 10.3837/tiis.2012.11.004
- ISSN
- 1976-7277
- Abstract
- Various stakeholders are involved in the creation of software projects. In general, the higher the number of stakeholders involved during the requirements elicitation phase, the better are the chances of success for the project. However, it is rather difficult to consider the opinion of all the stakeholders owing to constraints on time and resources. Furthermore, conflicts between stakeholders can become inevitable when the number of stakeholders increases. Thus, the identification of key stakeholders is an important factor in ensuring the success of a project. In this paper, a methodical stakeholder conflict resolution model (s-CRM) is proposed by considering an actual industrial case study. The proposed model uses information gain based on entropy when measuring the impurity of information. We believe that the proposed s-CRM is effective in identifying the key stakeholders and in intuitively indicating those stakeholders whose elicited requirements need to be weighted. In addition, the model provides a solution for conflicts among stakeholders during requirements engineering.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.