DocumentCode :
3481413
Title :
Eliciting Considerable Requirements with Word and Customer Graphs
Author :
Kimura, Daichi ; Gotoh, Tomohisa ; Ikeda, Ken´ichi
Author_Institution :
Service Platforms Res. Labs., NEC Corp., Kawasaki, Japan
fYear :
2011
fDate :
18-22 July 2011
Firstpage :
476
Lastpage :
485
Abstract :
We propose a graph-based method to elicit considerable requirements from customer survey results. Requirements usually have relationships with each other, and understanding such relationships gives us deeper insight. One useful approach to investigate the relationships is making a co-occurrence graph of words where links are connected if words co-occur in a specific requirement. If we find uncommon links from the word graph, they help us to elicit considerable requirements. In our method, we make a customer graph in addition to a word graph. This method indicates some uncommon relationships by reflecting centrality analysis of the customer graph to the links of the word graph. We have applied our method to the result of a survey using a questionnaire containing open-ended answer question. Links in the word graph made from the survey results include information of customers. We have shown we can elicit some considerable contexts, by reflecting the information of customers who bridge majorities and minorities.
Keywords :
customer relationship management; formal specification; graph theory; word processing; centrality analysis; considerable requirements; customer graphs; customer survey; open-ended answer question; word graph; Atmosphere; Bridges; Cameras; Cellular phones; Context; Libraries; Licenses; co-occurrence graphs; complex networks; social networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Software and Applications Conference (COMPSAC), 2011 IEEE 35th Annual
Conference_Location :
Munich
ISSN :
0730-3157
Print_ISBN :
978-1-4577-0544-1
Electronic_ISBN :
0730-3157
Type :
conf
DOI :
10.1109/COMPSAC.2011.68
Filename :
6032384
Link To Document :
بازگشت