Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339040
Chao Cheng, Xingjun Wang, Zhiyong Li, Yuxi Lin
Recommender Systems(RSs) are software tools and techniques providing suggestions for items to be of use to a user. With the increasing development of Internet and explosion of information, recommender system has been an indispensable component in many applications. In this paper, a recommendation algorithm based on factorization model is proposed, which is applied to TV system. To quantize users' interest/preference to programs, a novel and rational notation, user interest index, is defined and helps improve recommendation effect. The vectorization of users and programs are derived from item clustering. Finally, we adopted top-K recommendation strategy, and evaluated the performance of our algorithm. According to experiment results, we found that the algorithm performs well on precision and recall rate.
{"title":"A new TV recommendation algorithm based on interest quantification and item clustering","authors":"Chao Cheng, Xingjun Wang, Zhiyong Li, Yuxi Lin","doi":"10.1109/ICSESS.2015.7339040","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339040","url":null,"abstract":"Recommender Systems(RSs) are software tools and techniques providing suggestions for items to be of use to a user. With the increasing development of Internet and explosion of information, recommender system has been an indispensable component in many applications. In this paper, a recommendation algorithm based on factorization model is proposed, which is applied to TV system. To quantize users' interest/preference to programs, a novel and rational notation, user interest index, is defined and helps improve recommendation effect. The vectorization of users and programs are derived from item clustering. Finally, we adopted top-K recommendation strategy, and evaluated the performance of our algorithm. According to experiment results, we found that the algorithm performs well on precision and recall rate.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339003
A. Souri, Monire Norouzi
Probabilistic real-time systems have a difficult controlling management, because of their random behaviors and quantitative operations. So, the procedure of system behavior will changed any time. Adding a probable factor can effect on some systematic problems such as fairness, deadlock and starvation in a probabilistic real-time system. In this paper, we study on a new probable decision making approach for the probabilistic real-time systems using PAT and NuSMV model checkers. Also we analyze the verification methods and the feasibility of our approach on a case study by comparing two model checkers results. The experimental results show that the proposed approach performs substantially better than the other benchmark methods.
{"title":"A new probable decision making approach for verification of probabilistic real-time systems","authors":"A. Souri, Monire Norouzi","doi":"10.1109/ICSESS.2015.7339003","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339003","url":null,"abstract":"Probabilistic real-time systems have a difficult controlling management, because of their random behaviors and quantitative operations. So, the procedure of system behavior will changed any time. Adding a probable factor can effect on some systematic problems such as fairness, deadlock and starvation in a probabilistic real-time system. In this paper, we study on a new probable decision making approach for the probabilistic real-time systems using PAT and NuSMV model checkers. Also we analyze the verification methods and the feasibility of our approach on a case study by comparing two model checkers results. The experimental results show that the proposed approach performs substantially better than the other benchmark methods.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124918202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339013
Zhouyang Li, Lianzhong Liu, Chunfang Li
This paper proposes an approach to analyze customer satisfaction from Chinese reviews using opinion mining. Opinion mining technology is adopted to analyze customer satisfaction and discover useful information that can provide decision support. The proposed approach first extracts and groups the aspects simultaneously through a topic model based method. Then utilizing sentence based opinion mining method to calculate sentiment score of each aspect as its satisfaction ratio, after that showing the most satisfied and unsatisfied feature in graphical format. Finally, utilizing customer reviews of a mobile phone from Taobao.com, a case study is presented to illustrate effectiveness of the proposed approach.
{"title":"Analysis of customer satisfaction from Chinese reviews using opinion mining","authors":"Zhouyang Li, Lianzhong Liu, Chunfang Li","doi":"10.1109/ICSESS.2015.7339013","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339013","url":null,"abstract":"This paper proposes an approach to analyze customer satisfaction from Chinese reviews using opinion mining. Opinion mining technology is adopted to analyze customer satisfaction and discover useful information that can provide decision support. The proposed approach first extracts and groups the aspects simultaneously through a topic model based method. Then utilizing sentence based opinion mining method to calculate sentiment score of each aspect as its satisfaction ratio, after that showing the most satisfied and unsatisfied feature in graphical format. Finally, utilizing customer reviews of a mobile phone from Taobao.com, a case study is presented to illustrate effectiveness of the proposed approach.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339145
Z. Chunsheng, Tu Ya
Mongolian medicinéis an important branch of Chinese national medicine, having its unique medical theory. There are both similarities and different characteristics between Mongolian medicine and traditional Chinese medicine. In this paper, according to the feature of the small number of Mongolian medicine prescriptions and the big difference between the number of drugs, the author puts forward the the way of attribute reduction in advance, showing the approximate reduction result data set by views, using two dimensional matrix as the data mining target data set, reducing the complexity of the mining algorithm, using the method of index technology optimization of storage structure. The example indicates that the method of data reduction has an obvious effect, which is an effective means for Mongolian medicine prescription data mining.
{"title":"A study on the method of building data mining architecture for Mongolian medicine prescription","authors":"Z. Chunsheng, Tu Ya","doi":"10.1109/ICSESS.2015.7339145","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339145","url":null,"abstract":"Mongolian medicinéis an important branch of Chinese national medicine, having its unique medical theory. There are both similarities and different characteristics between Mongolian medicine and traditional Chinese medicine. In this paper, according to the feature of the small number of Mongolian medicine prescriptions and the big difference between the number of drugs, the author puts forward the the way of attribute reduction in advance, showing the approximate reduction result data set by views, using two dimensional matrix as the data mining target data set, reducing the complexity of the mining algorithm, using the method of index technology optimization of storage structure. The example indicates that the method of data reduction has an obvious effect, which is an effective means for Mongolian medicine prescription data mining.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123776110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339225
F. Yuan, F. Lian, Xingjian Xu, Zhaohua Ji
With the advent of the computer science, the data volume that needed to be processed under many practical situations increases dramatically, challenging many traditional machine learning techniques. Bearing this in mind, we made an intensive study on the optimization of decision tree algorithm and its corresponding porting to the big data analysis in this paper. An optimized genetic algorithm is merged into the implementation of the decision tree algorithm above, and we also invent a parallel genetic decision tree algorithm using MapReduce, which is very suitable for analyzing big data in cloud computing environment. Experiment results show that our algorithm acquires a nearly linear speedup, keeping a similar classification accuracy at the same time.
{"title":"Decision tree algorithm optimization research based on MapReduce","authors":"F. Yuan, F. Lian, Xingjian Xu, Zhaohua Ji","doi":"10.1109/ICSESS.2015.7339225","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339225","url":null,"abstract":"With the advent of the computer science, the data volume that needed to be processed under many practical situations increases dramatically, challenging many traditional machine learning techniques. Bearing this in mind, we made an intensive study on the optimization of decision tree algorithm and its corresponding porting to the big data analysis in this paper. An optimized genetic algorithm is merged into the implementation of the decision tree algorithm above, and we also invent a parallel genetic decision tree algorithm using MapReduce, which is very suitable for analyzing big data in cloud computing environment. Experiment results show that our algorithm acquires a nearly linear speedup, keeping a similar classification accuracy at the same time.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117247488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339088
S. Waheed, Usman Qamar
Testing is way of insuring quality of the product. Object oriented testing is challenging task. It becomes more intense in integration level when different units interact for proper functioning of system. These Interacting Objects must be in desired state to achieve the required coverage. This can be achieved by generating method sequences. Manually test case generation is a tedious job and in object oriented testing method explosion make it worst. In this paper we propose a novel approach for test case generation of object oriented integration testing. Search space is reduced by selecting the coupling methods that are directly involved in integration. Further def-use analysis helps in achieving the desired object states for proper interfaces testing, representing methods in testing tree. This paper also identifies problematic cases and their solutions in method sequence generation. Results shown significant improvements in object oriented integration testing.
{"title":"Data flow based test case generation algorithm for object oriented integration testing","authors":"S. Waheed, Usman Qamar","doi":"10.1109/ICSESS.2015.7339088","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339088","url":null,"abstract":"Testing is way of insuring quality of the product. Object oriented testing is challenging task. It becomes more intense in integration level when different units interact for proper functioning of system. These Interacting Objects must be in desired state to achieve the required coverage. This can be achieved by generating method sequences. Manually test case generation is a tedious job and in object oriented testing method explosion make it worst. In this paper we propose a novel approach for test case generation of object oriented integration testing. Search space is reduced by selecting the coupling methods that are directly involved in integration. Further def-use analysis helps in achieving the desired object states for proper interfaces testing, representing methods in testing tree. This paper also identifies problematic cases and their solutions in method sequence generation. Results shown significant improvements in object oriented integration testing.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129486718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339090
Hamad Naeem, J. Sang, Waqar Ali Abro, M. Naeem
In existing educational environment, teacher's performance is playing vital role in growth of students as well as institution. The quality of Instruction is basic constituent for successful learning. For better collaboration between students and teachers, it has become mandatory to introduce comprehensive performance evaluation mechanism. In modern age, information technology provides us optimal solution to evaluate teacher's performance. In this paper, we proposed a generic feedback model using unified modeling language (UML). This model can be easily implemented in any institutional environment due to its non specific behavior. This model predicts better results of teacher's performance using methods of data mining tool. In the conclusion, we compared results of various data mining techniques and also suggesting an appropriate method for this system.
{"title":"A generic feedback system for better evaluation of teacher performance","authors":"Hamad Naeem, J. Sang, Waqar Ali Abro, M. Naeem","doi":"10.1109/ICSESS.2015.7339090","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339090","url":null,"abstract":"In existing educational environment, teacher's performance is playing vital role in growth of students as well as institution. The quality of Instruction is basic constituent for successful learning. For better collaboration between students and teachers, it has become mandatory to introduce comprehensive performance evaluation mechanism. In modern age, information technology provides us optimal solution to evaluate teacher's performance. In this paper, we proposed a generic feedback model using unified modeling language (UML). This model can be easily implemented in any institutional environment due to its non specific behavior. This model predicts better results of teacher's performance using methods of data mining tool. In the conclusion, we compared results of various data mining techniques and also suggesting an appropriate method for this system.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129841407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339157
Yun-yun Du, Hong-yun Ning, Zhi-xin Yang, Yan-xia Cui
Aiming at the defect that the current time dependent road network model cannot fully reflect the information of the road attribute, and considering that the road weights of traffic congestion factors should be based on the characterization of travel time and the impedance function model of average speed relations, we put forward the improved road network model which is based on the edge cost analysis; Then we propose the ant colony optimization algorithm of a new hierarchical restricted search area and the corresponding dynamic switching strategy for traffic jams, when the search level can be dynamically adjusted by the road capacity of traffic congestion, we can achieve the purpose of improving the quality of route planning and avoiding the congested road. Our simulation experiment uses the scheme of random allocation speed value by speed fitting function, and provides the multi-population ant colony algorithm based on layered restricted searching area is significantly better than others.
{"title":"Ant colony algorithm for multilevel restricted searching area based on time dependent road network model","authors":"Yun-yun Du, Hong-yun Ning, Zhi-xin Yang, Yan-xia Cui","doi":"10.1109/ICSESS.2015.7339157","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339157","url":null,"abstract":"Aiming at the defect that the current time dependent road network model cannot fully reflect the information of the road attribute, and considering that the road weights of traffic congestion factors should be based on the characterization of travel time and the impedance function model of average speed relations, we put forward the improved road network model which is based on the edge cost analysis; Then we propose the ant colony optimization algorithm of a new hierarchical restricted search area and the corresponding dynamic switching strategy for traffic jams, when the search level can be dynamically adjusted by the road capacity of traffic congestion, we can achieve the purpose of improving the quality of route planning and avoiding the congested road. Our simulation experiment uses the scheme of random allocation speed value by speed fitting function, and provides the multi-population ant colony algorithm based on layered restricted searching area is significantly better than others.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339175
H. Sutopo
This paper is intended to develop a bubble sort algorithm visualization for an Algorithm and Programming course in computer education. This learning model should encourage student's ability to learn the variety of sorting, such as selection sort, merge sort. etc. This research consists of 6 steps in visualization development such as need assessment, front-end analysis, design, development, implementation, and evaluation. During the testing step, the application is run and checked to confirm that it performs exactly what the author has intended and the students can learn bubble sorting algorithm by studying the visualization. Research findings indicated that the students increased their motivation and ability to create sorting visualitation application. Based on the data of process and product competencies taken from the evaluation, 85 per cent of the students were competent in sorting visualization programming and there were 15 per cent of the students were not competent.
{"title":"Multimedia based instructional development: Bubble sort visualization","authors":"H. Sutopo","doi":"10.1109/ICSESS.2015.7339175","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339175","url":null,"abstract":"This paper is intended to develop a bubble sort algorithm visualization for an Algorithm and Programming course in computer education. This learning model should encourage student's ability to learn the variety of sorting, such as selection sort, merge sort. etc. This research consists of 6 steps in visualization development such as need assessment, front-end analysis, design, development, implementation, and evaluation. During the testing step, the application is run and checked to confirm that it performs exactly what the author has intended and the students can learn bubble sorting algorithm by studying the visualization. Research findings indicated that the students increased their motivation and ability to create sorting visualitation application. Based on the data of process and product competencies taken from the evaluation, 85 per cent of the students were competent in sorting visualization programming and there were 15 per cent of the students were not competent.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"5 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132031003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-30DOI: 10.1109/ICSESS.2015.7339180
Jiajun Wu, Xiaodong Fu, Li Liu, Lijun Liu, Qingsong Huang
Community of Web Service is a society composed by a number of functionally identical Web Services. The communities are regarded as a whole for users in an opening environment and users would pay for services when they invoke Web Service successfully. Communities should distribute the whole profit to all of the providers of Web Services inside after a settlement period. Due to the cooperation among Web Services in a community we treat these Web Services as a cooperative game. In this paper we propose a method to distribute profit based on Shapley value which considers the contribution of each Web Service to community and we then implement an algorithm based on MC-nets to suit the actual situation which we always cannot get complete input for general algorithm of computing Shapley value. We also show our method is efficient and practicable.
{"title":"Distributing profit of web services communities based on Shapley value","authors":"Jiajun Wu, Xiaodong Fu, Li Liu, Lijun Liu, Qingsong Huang","doi":"10.1109/ICSESS.2015.7339180","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339180","url":null,"abstract":"Community of Web Service is a society composed by a number of functionally identical Web Services. The communities are regarded as a whole for users in an opening environment and users would pay for services when they invoke Web Service successfully. Communities should distribute the whole profit to all of the providers of Web Services inside after a settlement period. Due to the cooperation among Web Services in a community we treat these Web Services as a cooperative game. In this paper we propose a method to distribute profit based on Shapley value which considers the contribution of each Web Service to community and we then implement an algorithm based on MC-nets to suit the actual situation which we always cannot get complete input for general algorithm of computing Shapley value. We also show our method is efficient and practicable.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134062705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：