{"title":"Feature Distribution Based Quick Image Retrieval","authors":"Weifeng Zhang, Shuaiqiu Men, Lei Xu, Baowen Xu","doi":"10.1109/WISA.2010.48","DOIUrl":"https://doi.org/10.1109/WISA.2010.48","url":null,"abstract":"Query by image example is still a challenge in image retrieval. The goal of similarity retrieval in images is to get the similar images quickly and accurately in high-dimension space. The accuracy of similarity retrieval in high-dimension space is mainly decided by the features representing images and the method used for similar calculation. Our main goal in this paper is to improve the retrieval speed without great lost of accuracy. We propose a filtering method to greatly reduce the search range based on two assumptions: (1) the similar images will have similar amount of SIFT (scale invariant feature transform) features;(2) the similar images will all contain the important features. In contrast to prior work on similarity retrieval in high-dimension space, we use the distribution of features of images to filter the target images. Experimental results show that our approach can significantly reduce the time complexity.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023050","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":"Find Answers from Web Search Results","authors":"Huitao Dou, Qingzhong Li, Yongxin Zhang","doi":"10.1109/WISA.2010.26","DOIUrl":"https://doi.org/10.1109/WISA.2010.26","url":null,"abstract":"In a variety of domains, the amount of information grows rapidly; new sources and types of information are proliferating. In recent years, the world-wide web information has been growing at a dramatic pace and might have become the most important information source for most people. In daily life, when people encounter some problems, they tend to retrieve the information from the Web search engines. Many business search engines are efficient at identifying the best web sites for any given keyword query. Unfortunately, the information on the web is not always correct. Moreover, different web sites often provide different information on a subject. One headache problem we have to face is how to distinguish between what is true and what is wrong. In this paper, we propose a computational method to find answers from web search results. Intuitively, if a value is provided by many accurate web sites, it is very likely that the value is correct. We adopt an iterative method to compute the accuracy of web sites and the confidence of values. Finally we find the most likely correct answers and return to the users for further choice.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114503748","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":"Mashup FOAF for Video Recommendation LightWeight Prototype","authors":"Shijun Li, Yunlu Zhang, Hao Sun","doi":"10.1109/WISA.2010.49","DOIUrl":"https://doi.org/10.1109/WISA.2010.49","url":null,"abstract":"There are more and more xml document, web services, feeds and so on and so forth cheap, network accessible resources to use. As one of the most widely used semantic web project, FOAF (Friend of a Friend) pays more and more attention to FOAF semantic features to analyze users’ interest and to recommend to FOAF users recent years. This essay focuses on applying FOAF to a latest online television programs recommendation system for a particular user. In this paper television programs come from various online video web sites that a user has registered in are watched at different time. The article describes the approach to such services based on HMM (Hidden Markov Model) and FOAF project. In order to protect the user’s privacy when providing services, this system is designed as a local-service desktop model. We conduct experiments to illustrate users’ high degree of satisfaction to our techniques.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628439","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":"Crawling Result Pages for Data Extraction Based on URL Classification","authors":"Tiezheng Nie, Zhenhua Wang, Yue Kou, Rui Zhang","doi":"10.1109/WISA.2010.14","DOIUrl":"https://doi.org/10.1109/WISA.2010.14","url":null,"abstract":"In Web database integration, crawling data pages is important for data extraction. The fact that data are contained by multiple result pages increases the difficulty of accessing data for integration. Thus, it is necessary to accurately and automatically crawl query result pages from Web database. To address this problem, we propose a novel approach based on URL classification to effectively identify result pages. In our approach, we compute the similarity between URLs of hyperlinks in result pages and classify them into four categories. Each category maps to a set of similar web pages, which separate result pages from others. Then, we use the page probing method to verify the correctness of classification and improve the accuracy of crawled result pages. The experimental result demonstrates that our approach is effective for identifying the collection of result pages in Web database, and can improve the quality and efficiency of data extraction.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123271030","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 Novel QoS Predication Approach Based on Regression Algorithm","authors":"Yuliang Shi, Kun Zhang, Bing Liu, Qingzhong Li","doi":"10.1109/WISA.2010.50","DOIUrl":"https://doi.org/10.1109/WISA.2010.50","url":null,"abstract":"Recently, as an important way of software applications, web services technology developed rapidly. As many web services provide the same functionality, quality of service (QoS) has become an important criterion for service selection. However, the QoS value provided by service provider is being tested in an ideal runtime, regardless of the effect of the actual load and different service time. This paper uses web service runtime period and service load as criteria, considers QoS historical data, and proposes a novel real-time QoS predication approach based on dualistic linear regression algorithm, which could be used to select the optimal web services. Experiments demonstrate the efficiency of the approach.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122164139","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 Novel Framework for Ranking Model Adaptation","authors":"Peng Cai, Aoying Zhou","doi":"10.1109/WISA.2010.12","DOIUrl":"https://doi.org/10.1109/WISA.2010.12","url":null,"abstract":"Domain adaptation is an important problem in learning to rank due to the lack of training data in a new search task. Recently, an approach based on instance weighting and pairwise ranking algorithms has been proposed to address the problem by learning a ranking model for a target domain only using training data from a source domain. In this paper, we propose a novel framework which extends the previous work using a listwise ranking algorithm for ranking adaptation. Our framework firstly estimates the importance weight of a query in the source domain. Then, the importance weight is incorporated into the state-of-the-art listwise ranking algorithm, known as AdaRank. The framework is evaluated on the Letor3.0 benchmark dataset. The results of experiment demonstrate that it can significantly outperform the baseline model which is directly trained on the source domain, and most of the time not significantly worse than the optimal model which is trained on the target domain.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129800701","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":"DESP: An Automatic Data Extractor on Deep Web Pages","authors":"Ji Ma, Derong Shen, Tiezheng Nie","doi":"10.1109/WISA.2010.15","DOIUrl":"https://doi.org/10.1109/WISA.2010.15","url":null,"abstract":"We present DESP, an automatic data extractor on Deep Web pages for book domain, which can extract data items and label attributes at the same time. The case of DESP is to extract books’ information such as title, author, price and publisher from result pages returned from bookstore web sites. Although DESP is for a specific domain, the method used by DESP is highly adaptive and can suit other domains. The system consists of two parts, one is Data Record Locater, the Modified Data Locating algorithm used by it overcomes the shortcoming of the MDR algorithm, the other is Attribute Labeler, and the Detect Combine algorithm makes the data item have a more explicit meaning.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125981939","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":"Modeling Users' Visiting Behaviors for Web Load Testing by Continuous Time Markov Chain","authors":"Lei Xu, Weifeng Zhang, Lianjie Chen","doi":"10.1109/WISA.2010.47","DOIUrl":"https://doi.org/10.1109/WISA.2010.47","url":null,"abstract":"Virtual users with high quality are the preconditions to ensure the effect of load testing for Web applications. The existed tools for load testing usually generate virtual users with randomly choosing user sessions, manually generating user sessions or mining Log files, which causing such problems as non-real workload, subjectivity or difficult to update. Therefore we set each virtual user with a corresponding configure file, and these files determine the visiting paths, visiting moments and stay time of virtual users based on the Continuous Time Markov Chain. So we firstly finish the pretreatment for Log files, then construct the user visiting model, and next generate the virtual users, lastly carry out the load testing. In this way, we can obtain more reliable results for Web application load testing than the existed methods.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130754956","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}
Boshi Sun, Xiaojie Yuan, Hong Kang, Xiaocheng Huang, Ying Guan
{"title":"Incremental Validation of XML Document Based on Simplified XML Element Sequence Pattern","authors":"Boshi Sun, Xiaojie Yuan, Hong Kang, Xiaocheng Huang, Ying Guan","doi":"10.1109/WISA.2010.28","DOIUrl":"https://doi.org/10.1109/WISA.2010.28","url":null,"abstract":"With XML becoming the de facto standard for representing and exchanging data on the Internet, the problem of validation of XML data when updated has attracted more and more attentions. The traditional brute-force validation processes the entire updated XML document from scratch, which is less efficient. This paper presents a method for XML incremental validation based on simplified XML element sequence pattern, ensuring the XML document to remain conforming to the constrains established by XML Schema. The incremental method focuses on the fragment that the update operations directly affected and thus is more efficient compared to the traditional methods.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800890","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":"Exploiting Web Service Usage Context to Facilitate Services Organization","authors":"Rong Zhang, K. Zettsu, Y. Kidawara, Y. Kiyoki","doi":"10.1109/WISA.2010.45","DOIUrl":"https://doi.org/10.1109/WISA.2010.45","url":null,"abstract":"Service-oriented architectures (SOA) are becoming the dominant computing paradigm, where all resources are abstracted as services to form services society. Open-access and easy-visiting of services are keys to services eco-system, thus service search engines will play an increasingly important role. Generally retrieved services are listed and ranked by the content similarities to queries. One problem is that if user clicks one service and finds that it is not good. Then how to find similar services to this service is a challenging problem. We find that traditional content-based similarity calculation method is insufficient to clustering similar services. In this paper, we introduce a concept of services “context” to characterize services. By using service context, we build services related collaboration graphs. A dynamic clustering approach is designed with respect to their contexts.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116255466","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}