{"title":"A real-time evolutionary algorithm for Web prediction","authors":"Dario Bonino, Fulvio Corno, Giovanni Squillero","doi":"10.1109/WI.2003.1241185","DOIUrl":"https://doi.org/10.1109/WI.2003.1241185","url":null,"abstract":"As an increasing number of users access information on the World Wide Web, there is a opportunity to improve well known strategies for Web caching, prefetching, dynamic user modeling and dynamic site customization in order to obtain better subjective performance and satisfaction in Web surfing. We propose a new method to exploit user navigational path behavior to predict, in real-time, future requests. Predicting user next requests is useful not only for document caching/prefetching, it is also suitable for quick dynamic portal adaptation to user behavior. Real-time user adaptation prevents the use of statistical techniques on Web logs, and we propose the adoption of a predictive user model based on finite state machines together with an evolutionary algorithm that evolves a population of FSMs for achieving a good prediction rate.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122258731","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":"Incremental document clustering using cluster similarity histograms","authors":"Khaled M. Hammouda, M. Kamel","doi":"10.1109/WI.2003.1241276","DOIUrl":"https://doi.org/10.1109/WI.2003.1241276","url":null,"abstract":"Clustering of large collections of text documents is a key process in providing a higher level of knowledge about the underlying inherent classification of the documents. Web documents, in particular, are of great interest since managing, accessing, searching, and browsing large repositories of Web content requires efficient organization. Incremental clustering algorithms are always preferred to traditional clustering techniques, since they can be applied in a dynamic environment such as the Web. An incremental document clustering algorithm is introduced, which relies only on pair-wise document similarity information. Clusters are represented using a cluster similarity histogram, a concise statistical representation of the distribution of similarities within each cluster, which provides a measure of cohesiveness. The measure guides the incremental clustering process. Complexity analysis and experimental results are discussed and show that the algorithm requires less computational time than standard methods while achieving a comparable or better clustering quality.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"56 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007148","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 new facial feature extraction method based on linear combination model","authors":"Yongli Hu, Baocai Yin, Dehui Kong","doi":"10.1109/WI.2003.1241256","DOIUrl":"https://doi.org/10.1109/WI.2003.1241256","url":null,"abstract":"A new facial feature extraction method is proposed. Based on linear combination model, the method locates feature points in facial images precisely. The model uses the knowledge of prototypic faces to interpret novel faces. To get the knowledge, the prototypes are labeled manually on the feature points. Generally, the construction of the linear combination model depends on pixel-wise alignments of prototypes, and the alignments are computed by an optical flow algorithm or bootstrapping algorithm which is a full-scale optimization and not includes local information such as facial feature points. To combine local facial feature with the linear combination model, a restrained optical flow algorithm is proposed to compute the pixel-wise alignments. With the information of labeled feature points, the model matches the input facial images and extracts the feature points automatically. Implementing the feature extraction method on the MPI face database, the experimental results show that the method has good performance.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116527699","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 comparative study of Zernike moments","authors":"T. Lin, Yun-Feng Chou","doi":"10.1109/WI.2003.1241255","DOIUrl":"https://doi.org/10.1109/WI.2003.1241255","url":null,"abstract":"Effective image retrieval by content requires that visual image properties are used instead of textual labels to properly index pictorial data. Shape is one of the primary low-level image features. Many shape representations had been proposed. The Zernike moment descriptor is the most suitable for shape similar-based retrieval in terms of computation complexity, compact representation, robustness, and retrieval performance. We study the first 36 Zernike moments and find the dependence relations between them. A new compact representation is proposed to replace the old one. It is not only saving storage capacity but also reducing the execution time of index generation.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133699243","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":"Embedded data indexing for fast stream interception by Internet appliances","authors":"J. Khan, Yihua He","doi":"10.1109/WI.2003.1241272","DOIUrl":"https://doi.org/10.1109/WI.2003.1241272","url":null,"abstract":"Interception of a data stream is central to any intelligent and dynamic processing of Web information. It is perhaps as fundamental to Internet services' overall architecture as the design of disk scheduling to the conventional machine architecture. We discuss an IPv6 based indexing protocol that can facilitate random access into multilevel hierarchically encoded content streams and provide serious performance boost to Web content processing.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133880828","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":"PageRank and Web communities","authors":"M. Bianchini, M. Gori, F. Scarselli","doi":"10.1109/WI.2003.1241217","DOIUrl":"https://doi.org/10.1109/WI.2003.1241217","url":null,"abstract":"The definition of the ordering of the Web pages, returned on a given query, is a crucial topic, which gives rise to the notion of Web visibility. A fundamental contribution towards the conception of appropriate ordering criteria has been given by means of the introduction of PageRank, which takes into account only the hyper-linked structure of the Web, regardless of the content of the pages. We introduce a circuit analysis which allows us to understand the distribution of PageRank, and show some basic results for understanding the way it migrates amongst communities. In particular, we highlight some topological properties which suggest methods for the promotion of Web communities. These results confirm the importance and the effectiveness of PageRank for discovering relevant information but, at the same time, point out its vulnerability to spamming.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114582297","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":"The formalization of argumentation and its application in network computing","authors":"Zhanmin Yang, Chundi Mu","doi":"10.1109/WI.2003.1241236","DOIUrl":"https://doi.org/10.1109/WI.2003.1241236","url":null,"abstract":"The new generation of network computing seeks for organic integration of information resources and computing resources in the Internet, whereas most important of all is to deal with the open information in the Internet which acts as an open information system. The intension and extension of a concept as well as its dynamics, some basic definitions, operations and theorems is first studied, then a new formalization method of argumentation is presented, which emphasizes concept dynamics and argumentation phases. Based on these works, an argumentation system is developed.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122124868","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":"Online recommendation based on customer shopping model in e-commerce","authors":"Junzhong Ji, Z. Sha, Chunnian Liu, N. Zhong","doi":"10.1109/WI.2003.1241175","DOIUrl":"https://doi.org/10.1109/WI.2003.1241175","url":null,"abstract":"As e-commerce developing rapidly, it is becoming a research focus about how to capture or find customer's behavior patterns and realize commerce intelligence by use of Web mining technology. Recommendation system in electronic commerce is one of the successful applications that are based on such mechanism. We present a new framework in recommendation system by finding customer model from business data. This framework formalizes the recommending process as knowledge representation of the customer shopping information and uncertainty knowledge inference process. In our approach, we firstly build a customer model based on Bayesian network by learning from customer shopping history data, then we present a recommendation algorithm based on probability inference in combination with the last shopping action of the customer, which can effectively and in real time generate a recommendation set of commodity.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615275","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":"WISE-building simple intelligence into Web services","authors":"S. Yuan, Kwei-Jay Lin","doi":"10.1109/WI.2003.1241166","DOIUrl":"https://doi.org/10.1109/WI.2003.1241166","url":null,"abstract":"Web services are self contained and self described modular applications that can be published, discovered and employed on the Web. Many standard protocols supporting Web services have been adopted and more are being proposed. We study the issue on providing intelligent Web services. We propose the enhancement of Web service functionalities by deploying software agents on both server side and/or client side. Our goal of designing the WISE Web service architecture is to provide a working middle ground between the current Web service standards and the semantic Web architecture. The WISE software agent architecture for Web services is presented. We discuss the design issues of WISE. We also present the QoS management protocol and algorithm that can be used by WISE servers.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127483840","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":"Local policies for the control of virtual communities","authors":"G. Boella, Leendert van der Torre","doi":"10.1109/WI.2003.1241188","DOIUrl":"https://doi.org/10.1109/WI.2003.1241188","url":null,"abstract":"Here we study the rational balance between local and global policies in Web based distributed systems. We use a logical framework for multiagent systems to model obligations and permissions composing policies. In particular, a qualitative decision theory allows agents to trade off the decision of respecting a norm against the consequences of not respecting it: the possibility that they are considered violators and thus sanctioned. Global policies refer not to the existence of a local norm but to the fact that it is enforced by the local authority by recognizing and sanctioning violations.","PeriodicalId":403574,"journal":{"name":"Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003)","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127324565","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}