{"title":"Sorting of Search Results Based on Data Quality","authors":"Liang Wang, Liwei Wang, Zufa Fu, Zeqian Huang, Zhiyong Peng","doi":"10.1109/WISA.2011.30","DOIUrl":"https://doi.org/10.1109/WISA.2011.30","url":null,"abstract":"With the rapid development of Web technology, more and more data on the web are considered as the source of information in current society. However, as the qualities of data fetched from different sources are different, it takes a lot of time to search the valuable data from tremendous web information. This paper proposed an approach to evaluate the data quality through integrating all dimensions of data representations. The evaluation of weight is estimated by the scores for data quality provided by users, which results in that the search results sorted by data quality can achieve the requirements of users. This method has been applied in a microbe system.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"56 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694572","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}
{"title":"A User-centered Approach to Recommending Business Process Slices","authors":"Xin Chen, Feng Zhang, Binge Cui, Yongshan Wei","doi":"10.1109/WISA.2011.12","DOIUrl":"https://doi.org/10.1109/WISA.2011.12","url":null,"abstract":"In this paper, a novel model of process slicing and user-centered recommendation is presented to make flexible reuses of business rules. Business processes are sliced in such angles as condition, action and resource. Suitable process slices are recommended to end-users with a proposed algorithm. The approach has been trial-used in emergency management, for supporting the modeling, execution and management of emergency plans before and during a disaster.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"85 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452141","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}
L. Peng, Ruixuan Li, Hongmin Wang, X. Gu, Kunmei Wen, Zhengding Lu
{"title":"An Encrypted Index Mechanism in Ciphertext Retrieval System","authors":"L. Peng, Ruixuan Li, Hongmin Wang, X. Gu, Kunmei Wen, Zhengding Lu","doi":"10.1109/WISA.2011.32","DOIUrl":"https://doi.org/10.1109/WISA.2011.32","url":null,"abstract":"The cipher text-based full-text retrieval technology is proposed to satisfy the pressing demands for high security in massive information sharing applications. Based on the analysis of general technology of full-text indexing, we propose an improved index structure that supports cipher text indexing and retrieval. Then we present approaches to construct, maintain and retrieve cipher text indexes. Meanwhile, we implement a cipher text-based full-text retrieval system, which allows full-text search on the encrypted documents in multiple formats without decryption. Finally, we carry out the experiments and evaluate the performance of cipher text index construction and retrieval.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115801055","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}
{"title":"A Multi-dimension Trust Risk Evaluation for E-commerce Systems","authors":"Zaobin Gan, Xialan Xiao, Kai Li","doi":"10.1109/WISA.2011.34","DOIUrl":"https://doi.org/10.1109/WISA.2011.34","url":null,"abstract":"In view of consumers, the risk of e-commerce transaction is divided into the subjective risk and the objective risk in this paper. Then, a multi-dimensional trust risk evaluation model (MTREM) is proposed for e-commerce based on the qualitative analysis of the subjective risk and the objective risk. In the model, the risk is dynamically and quantitatively evaluated in terms of the seller’s reputation, the commodity price, the consumer’s income, the consumer’s consumption idea (the risk tolerance), and the transaction experience. Finally, the actual transaction data from Taobao is used in the simulation experiment, a comparative analysis is done for MTREM. The experiment shows that the computing result from MTREM is similar to the qualitative analysis from some existing researches. However, the risk factors in the model are considered more comprehensively and more objectively, the computing result from MTREM is quantitative and easy to be understood and accepted. 1","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116611623","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}
{"title":"Concept Similarity Computation for Ontology in the Automatic Question-Answering System","authors":"Wu Wen-yan, Wang Wei, Liu Xing-yang, Xu Li-zhen","doi":"10.1109/WISA.2011.15","DOIUrl":"https://doi.org/10.1109/WISA.2011.15","url":null,"abstract":"As the key point of the ontology research field, concept similarity computation has been widely used in the automatic question-answering systems. This paper firstly analyzes the existing concept similarity computation algorithm which is based on the semantic distance, and then proposes a new computation algorithm formula by modifying and adding some factors which can affect the accuracy of concept similarity computation. Finally, the experimental results show that the proposed algorithm offers better effectiveness for the concept similarity computation.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116841366","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}
{"title":"Dual-strategy Analysis Model Based on Clustering and Inter-transaction","authors":"F. Sun, Yonggong Ren, Yanyan Qi","doi":"10.1109/WISA.2011.22","DOIUrl":"https://doi.org/10.1109/WISA.2011.22","url":null,"abstract":"Inter-transactional association rules mining is mainly used in mining significant association between different transaction, but the existing algorithm only focus on the efficiency or accuracy. In this study, we propose the inter-transactional association rules algorithm based on cluster and dual-strategy analysis model. The algorithm adopts dual-strategy interest model to judge the integrity of the inter-transactional association rules, make up for mining bugs, avoid the generation of false rules, improve the quality of the mining algorithm; And use of cluster analysis to remove a large number of redundant data in database, improve the efficiency of the algorithm. The experimental results show that the proposed algorithm improves accuracy and efficiency of inter-transactional association rules algorithm. Keywords-Dual-strategy interest model;cluster analysis;Markov model","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123143487","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}
{"title":"WNOntoSim: A Hybrid Approach for Measuring Semantic Similarity between Ontologies Based on WordNet","authors":"Wei He, Xiaoping Yang, Dupei Huang","doi":"10.1007/978-3-642-25975-3_7","DOIUrl":"https://doi.org/10.1007/978-3-642-25975-3_7","url":null,"abstract":"","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122748149","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}
{"title":"Clustering of Web Search Results Based on Combination of Links and In-Snippets","authors":"Nan Yang, Yue Liu, Gang Yang","doi":"10.1109/WISA.2011.28","DOIUrl":"https://doi.org/10.1109/WISA.2011.28","url":null,"abstract":"Search engine is a common tool to retrieve the information in the Web. But the current status of returned results is still far from satisfaction. Users have to be confronted with searching for a long result list to get the information really wanted. Many works focused on the post processing search results to facilitate users to examine the results. One of the common ways of post processing search result is clustering. Term-based clustering appears as first way to cluster the results. But this method is suffering from the poor quality while the processed pages have little text. Link-based clustering can conquer this problem. But the quality of clusters heavily depends on the number of in-links and out-links in common. In this paper, we propose that the short text attached to in-link is valuable information and it is helpful to reach high clustering quality. To distinguish them with general snippet, we name it as in-snippet. Based on the in-snippet, we propose a new clustering method that combines the links and the in-snippets together. In our method, similarity between pages consists of two parts : link similarity and term similarity. We designed related algorithm to implement clustering. In order to prevent bias from human judgments, the experiment datasets are collected from Open Directory Project(DMOZ). Due to DMOZ is human-edited directory, the datasets from DMOZ has higher quality and larger scale. We use entropy and f-measure to evaluate the quality of the final clusters. By being compared with the link-based and the pure term-based algorithms, our method outperforms others in clustering quality.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122196250","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}
{"title":"Clustering-Based Touching-Cells Division","authors":"Hao-jun Sun, Qingnan Zeng","doi":"10.1109/WISA.2011.33","DOIUrl":"https://doi.org/10.1109/WISA.2011.33","url":null,"abstract":"Automated cell segmentation of microscopy cell images play an important role in various applications of cell images analysis. Nowadays, the automated methods for cell segmentation is still challenging in situations, not only the fuzzy microscopy cell images but also where there might be touching cells. In this paper we propose a method for identifying the touching cells. we use a combination of image segmentation, extraction of connected components, Hough transform and cluster analysis to separate the touching cells.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115399816","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}
{"title":"An Adaptive Approach to Resource Provisioning in PaaS","authors":"Huayang Yu, Xue Li, Shidong Zhang, Yuliang Shi","doi":"10.1109/WISA.2011.17","DOIUrl":"https://doi.org/10.1109/WISA.2011.17","url":null,"abstract":"In PaaS, the issue of resource provisioning becomes more challenging because a great number of applications share and compete for resources simultaneously. PaaS platform should be able to maximize the resources utilization, while satisfying the performance requirements of all applications. However on-line request workload can be fluctuated during the run time of applications and static resource allocation may cause either under provisioning or over provisioning problem. In this paper, we propose an adaptive resource provisioning approach to dynamically allocate resources for applications according to the workload variation. In case of performance violation, our approach can make an efficient plan to keep application performance within a valid range.","PeriodicalId":242633,"journal":{"name":"2011 Eighth Web Information Systems and Applications Conference","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124687849","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}