The abnormal patterns in hydrological time series play an important role in the analysis and decision-making. Aiming at the problems that the amount of hydrological data is large and there is a lot of “noise” in this data, which lead to the high time complexity of traditional anomaly detection algorithm, we propose anomaly pattern detection based on density for hydrological time series. Firstly, this method makes a piecewise linear representation of the sequence through the important feature points, then extracts the slope, length and mean of the pattern, and maps them to the three-dimensional space. Finally, it calculates the local outlier factor of each pattern. The selection of important feature points and parameters in the algorithm are discussed and verified by the actual data which are historical water level of Jin-niu mountain reservoir. Experimental results show that the algorithm has low complexity and it has full mining results, which can meet the requirements of large-scale time series.
{"title":"Research on Anomaly Pattern Detection in Hydrological Time Series","authors":"Jianshu Sun, Yuansheng Lou, Feng Ye","doi":"10.1109/WISA.2017.73","DOIUrl":"https://doi.org/10.1109/WISA.2017.73","url":null,"abstract":"The abnormal patterns in hydrological time series play an important role in the analysis and decision-making. Aiming at the problems that the amount of hydrological data is large and there is a lot of “noise” in this data, which lead to the high time complexity of traditional anomaly detection algorithm, we propose anomaly pattern detection based on density for hydrological time series. Firstly, this method makes a piecewise linear representation of the sequence through the important feature points, then extracts the slope, length and mean of the pattern, and maps them to the three-dimensional space. Finally, it calculates the local outlier factor of each pattern. The selection of important feature points and parameters in the algorithm are discussed and verified by the actual data which are historical water level of Jin-niu mountain reservoir. Experimental results show that the algorithm has low complexity and it has full mining results, which can meet the requirements of large-scale time series.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116171512","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}
Yuanliang Chen, Jidong Ge, Yi Feng, Yemao Zhou, Chuanyi Li, Zhongjin Li, B. Luo
In the case of a traditional court judge, the facts are based on the law as the cornerstone, the fact that can be proved by the legal evidences. As we all know, assisting judges to manage evidence chain information can significantly improve the efficiency and quality of judges. Therefore, based on this idea, this paper will introduce the design and implementation of Visual Modeling Tool for evidence chain. The tool can help the judge to build various types of evidence chain, and can help to improve the work efficiency of judges. This visual modeling tool is divided into two main forms of visualization, includes the Graphical Mode and Table Mode. It means the same data with different display forms. So that the judge can deal with a large number of complex and varied evidence of chain information quickly and easily. Also, the efficiency of the judge to handle the case can be significantly improved.
{"title":"Design and Implementation of Visual Modeling Tool for Evidence Chain","authors":"Yuanliang Chen, Jidong Ge, Yi Feng, Yemao Zhou, Chuanyi Li, Zhongjin Li, B. Luo","doi":"10.1109/WISA.2017.2","DOIUrl":"https://doi.org/10.1109/WISA.2017.2","url":null,"abstract":"In the case of a traditional court judge, the facts are based on the law as the cornerstone, the fact that can be proved by the legal evidences. As we all know, assisting judges to manage evidence chain information can significantly improve the efficiency and quality of judges. Therefore, based on this idea, this paper will introduce the design and implementation of Visual Modeling Tool for evidence chain. The tool can help the judge to build various types of evidence chain, and can help to improve the work efficiency of judges. This visual modeling tool is divided into two main forms of visualization, includes the Graphical Mode and Table Mode. It means the same data with different display forms. So that the judge can deal with a large number of complex and varied evidence of chain information quickly and easily. Also, the efficiency of the judge to handle the case can be significantly improved.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125736841","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}
In this paper, we propose a clustering framework to analyze the log files generated along crowdsourcing mobile application testing. Our object is to automatically identify the type of testing work that the worker is performing as to reduce the work of developers clustering the test reports. By taking full data information of the log files, we establish the hierarchy of the testing data. Through the application of data processing and stream clustering methods, we accomplish the static mining and dynamic division of the test stream data. Experiments on a crowdsourcing mobile application testing dataset the efficacy of our approach.
{"title":"Clustering on the Stream of Crowdsourced Testing","authors":"Siyuan Shen, Hao Lian, Tieke He, Zhenyu Chen","doi":"10.1109/WISA.2017.47","DOIUrl":"https://doi.org/10.1109/WISA.2017.47","url":null,"abstract":"In this paper, we propose a clustering framework to analyze the log files generated along crowdsourcing mobile application testing. Our object is to automatically identify the type of testing work that the worker is performing as to reduce the work of developers clustering the test reports. By taking full data information of the log files, we establish the hierarchy of the testing data. Through the application of data processing and stream clustering methods, we accomplish the static mining and dynamic division of the test stream data. Experiments on a crowdsourcing mobile application testing dataset the efficacy of our approach.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121696056","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}
Huili Su, Yukun Li, Xiaoye Wang, Gang Hao, Yongxuan Lai, Weiwei Wang
Tables and spreadsheets on the Internet often contain valuable information, but are created by people who have different individuation. As a result, the similar data are often issued with different structures. This limits the integration of such tables. This paper aims to overcome this problem by automatically analyzing the structure area and propose the method transforming the tables into formal relational tables. We propose the methods on identifying structure area, modeling the table structure based on tree and methods to generate the 1NF schema of the original table. We proved the correctness of the method in semantic and the experiment results with tables from different areas demonstrate the effectiveness of our method.
{"title":"Transforming a Nonstandard Table into Formalized Tables","authors":"Huili Su, Yukun Li, Xiaoye Wang, Gang Hao, Yongxuan Lai, Weiwei Wang","doi":"10.1109/WISA.2017.38","DOIUrl":"https://doi.org/10.1109/WISA.2017.38","url":null,"abstract":"Tables and spreadsheets on the Internet often contain valuable information, but are created by people who have different individuation. As a result, the similar data are often issued with different structures. This limits the integration of such tables. This paper aims to overcome this problem by automatically analyzing the structure area and propose the method transforming the tables into formal relational tables. We propose the methods on identifying structure area, modeling the table structure based on tree and methods to generate the 1NF schema of the original table. We proved the correctness of the method in semantic and the experiment results with tables from different areas demonstrate the effectiveness of our method.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129773927","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}
Build prediction can reduce latency between continuous integration outcomes and the corresponding decisions, improving the efficiency of development team. Current build predictions are generally within-project, making it unavailable on those projects without enough build data. Cross-project prediction is the-state-of-art technique to solve the lack of training data on the studied projects by importing data from other projects. However, no previous study focuses on cross-project build predictions and checks the performance in the real world projects. This paper carries out an empirical study on the performance of cross-project build prediction with a wide range of 126 opensource projects under 6 common classifiers. In this paper, to select the training sets for cross-project prediction, we introduce two widely used data selection methods: Burak Filter based on build-level and Bellwether Strategy based on project-level. According to the results of our experiments, we have the following observations. Firstly, by the comparison between these two methods, we find that project-level selection (Bellwether strategy) performs better than build-level selection (Burak Filter). Furthermore, we observe that the prediction results can be improved by clustering the 126 studied projects into several smaller communities containing about 20-40 projects. And among 6 used classifiers, we find that decision tree classifier performs the best. Finally, by computing the optimal prediction results, we conclude that current selection methods still need to be improved to get close to the optimal prediction in cross-project build predictions.
{"title":"An Empirical Study on the Cross-Project Predictability of Continuous Integration Outcomes","authors":"Jing Xia, Yanhui Li, Chuanqi Wang","doi":"10.1109/WISA.2017.53","DOIUrl":"https://doi.org/10.1109/WISA.2017.53","url":null,"abstract":"Build prediction can reduce latency between continuous integration outcomes and the corresponding decisions, improving the efficiency of development team. Current build predictions are generally within-project, making it unavailable on those projects without enough build data. Cross-project prediction is the-state-of-art technique to solve the lack of training data on the studied projects by importing data from other projects. However, no previous study focuses on cross-project build predictions and checks the performance in the real world projects. This paper carries out an empirical study on the performance of cross-project build prediction with a wide range of 126 opensource projects under 6 common classifiers. In this paper, to select the training sets for cross-project prediction, we introduce two widely used data selection methods: Burak Filter based on build-level and Bellwether Strategy based on project-level. According to the results of our experiments, we have the following observations. Firstly, by the comparison between these two methods, we find that project-level selection (Bellwether strategy) performs better than build-level selection (Burak Filter). Furthermore, we observe that the prediction results can be improved by clustering the 126 studied projects into several smaller communities containing about 20-40 projects. And among 6 used classifiers, we find that decision tree classifier performs the best. Finally, by computing the optimal prediction results, we conclude that current selection methods still need to be improved to get close to the optimal prediction in cross-project build predictions.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130694151","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}
In the social network, to users, the tag is an important basis to mark and classify the resource. The tag of microblogging users can be used for advertising and network marketing. This paper presents a method based on naive Bayesian to predict the user tag. We use the user's basic attributes and some popular public tags as the features in Bayesian to predict whether a public tag belongs to a user. The experimental results show that the proposed method can achieve 87% accuracy.
{"title":"Microblogging User Tag Prediction Based on Bayesian","authors":"Guoqiang Gao, Ruixuan Li","doi":"10.1109/WISA.2017.14","DOIUrl":"https://doi.org/10.1109/WISA.2017.14","url":null,"abstract":"In the social network, to users, the tag is an important basis to mark and classify the resource. The tag of microblogging users can be used for advertising and network marketing. This paper presents a method based on naive Bayesian to predict the user tag. We use the user's basic attributes and some popular public tags as the features in Bayesian to predict whether a public tag belongs to a user. The experimental results show that the proposed method can achieve 87% accuracy.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"614 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720121","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}
with the continuous development of Internet technology, information overload is becoming more and more serious. It's getting harder to get useful information from the network. Although the search engine can help users find information they need from the vast amounts of information in a certain extent, but cannot completely solve the problem of information overload, when users cannot accurately describe the information they need, you need to recommend system to help users find valuable information for users. So recommender systems are becoming more and more important. The movie recommender system implemented in this paper is based on the traditional user-based collaborative filtering algorithm, and the user project scoring matrix is pre filled. At the same time, database technology of this system uses graph database which is good at dealing with complex relations. In data visualization, the degree of recommendation of a movie is expressed by the size of the node and the thickness of the edge, so as to improve the user experience.
{"title":"Design and Implementation of Movie Recommender System Based on Graph Database","authors":"N. Yi, Chunfang Li, Xin Feng, Minyong Shi","doi":"10.1109/WISA.2017.34","DOIUrl":"https://doi.org/10.1109/WISA.2017.34","url":null,"abstract":"with the continuous development of Internet technology, information overload is becoming more and more serious. It's getting harder to get useful information from the network. Although the search engine can help users find information they need from the vast amounts of information in a certain extent, but cannot completely solve the problem of information overload, when users cannot accurately describe the information they need, you need to recommend system to help users find valuable information for users. So recommender systems are becoming more and more important. The movie recommender system implemented in this paper is based on the traditional user-based collaborative filtering algorithm, and the user project scoring matrix is pre filled. At the same time, database technology of this system uses graph database which is good at dealing with complex relations. In data visualization, the degree of recommendation of a movie is expressed by the size of the node and the thickness of the edge, so as to improve the user experience.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123955681","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}
In this paper, we propose and design a IOT system that includes wearing glass and walking assistant for the blind people to guide them in daily life. Both the wearing glass design and walking assistant design falls into the scope of internet of things(IOT) design. Firstly, both the wearing glass and walking assistant are illuminated in function design and layout design. Secondly, the diagram of all components design are outlined and communication mechanism are highlighted. Finally, initial simulations are shown to validate our design. The layout design for this glass is demonstrated by figures. Security and privacy issues are paid attentions compared to Google glass design. Key enabling technologies for IOT are used in our design including Clouds computing, ZigBee communications to ensure the design is simple but efficient and of high security and privacy at the same time.
{"title":"An IoT System Design for Blind","authors":"Mingyong Zhou, Wenyan Li, Bo Zhou","doi":"10.1109/WISA.2017.72","DOIUrl":"https://doi.org/10.1109/WISA.2017.72","url":null,"abstract":"In this paper, we propose and design a IOT system that includes wearing glass and walking assistant for the blind people to guide them in daily life. Both the wearing glass design and walking assistant design falls into the scope of internet of things(IOT) design. Firstly, both the wearing glass and walking assistant are illuminated in function design and layout design. Secondly, the diagram of all components design are outlined and communication mechanism are highlighted. Finally, initial simulations are shown to validate our design. The layout design for this glass is demonstrated by figures. Security and privacy issues are paid attentions compared to Google glass design. Key enabling technologies for IOT are used in our design including Clouds computing, ZigBee communications to ensure the design is simple but efficient and of high security and privacy at the same time.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301086","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}
In this paper, we further investigate the spread communication approach using Chrestenson function and consider the practical aspects of it applications in modern communications technologies. First we elucidate the basics we published at reference [1], and outlined the communication basics including Shannon theory etc. Secondly, we highlight the trade-off among security/privacy, speed and authenticity and further investigate the practical aspects that can be applied in spread communications using Chrestenson function. Finally, we illustrate a fast algorithm of Discrete Chrestenson transform and show how it can be exploited to speed up the communication speed rate while keeping a high security. Our paper concentrates on investigating the security and privacy aspects in spread communication by using Chrestenson function.
{"title":"A Spread Communication Approach Using Chrestenson Function and Its Applications","authors":"Mingyong Zhou, Jianhe Zhou, Bo Zhou","doi":"10.1109/WISA.2017.56","DOIUrl":"https://doi.org/10.1109/WISA.2017.56","url":null,"abstract":"In this paper, we further investigate the spread communication approach using Chrestenson function and consider the practical aspects of it applications in modern communications technologies. First we elucidate the basics we published at reference [1], and outlined the communication basics including Shannon theory etc. Secondly, we highlight the trade-off among security/privacy, speed and authenticity and further investigate the practical aspects that can be applied in spread communications using Chrestenson function. Finally, we illustrate a fast algorithm of Discrete Chrestenson transform and show how it can be exploited to speed up the communication speed rate while keeping a high security. Our paper concentrates on investigating the security and privacy aspects in spread communication by using Chrestenson function.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121062972","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}
Due to the low quality of the existing online graph partition algorithm, the graph partition problem is solved through the Cat Swarm Optimization (CSO) algorithm to improve the partition quality. To avoid falling into the local optimum with CSO, an improved graph partition approach based on Cat Swarm Optimization with the Cauchy mutation and the Inertia weight (CICSO) was proposed. CICSO adopts the Cauchy mutation to update the optimal position, which can increase the accuracy of graph partition. Meanwhile, the self-adaptive inertia weight with the dynamic change is introduced in the tracking mode to increase the convergence speed and stability. Experimental results show that the improved cat algorithm CICSO has better performance than the standard cat algorithm in terms of partition quality and convergence time, compared with the LDG, FENNEL, and the standard CSO.
{"title":"Graph Partition Approach Based on the Cauchy Mutation and Inertia Weight","authors":"Yichao Wang, Yingchi Mao, Ziyang Xu, Ping Ping","doi":"10.1109/WISA.2017.51","DOIUrl":"https://doi.org/10.1109/WISA.2017.51","url":null,"abstract":"Due to the low quality of the existing online graph partition algorithm, the graph partition problem is solved through the Cat Swarm Optimization (CSO) algorithm to improve the partition quality. To avoid falling into the local optimum with CSO, an improved graph partition approach based on Cat Swarm Optimization with the Cauchy mutation and the Inertia weight (CICSO) was proposed. CICSO adopts the Cauchy mutation to update the optimal position, which can increase the accuracy of graph partition. Meanwhile, the self-adaptive inertia weight with the dynamic change is introduced in the tracking mode to increase the convergence speed and stability. Experimental results show that the improved cat algorithm CICSO has better performance than the standard cat algorithm in terms of partition quality and convergence time, compared with the LDG, FENNEL, and the standard CSO.","PeriodicalId":204706,"journal":{"name":"2017 14th Web Information Systems and Applications Conference (WISA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115904339","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
扫码关注我们
求助内容：
应助结果提醒方式：