As more and more people join online communities, the ability to better understand members' roles becomes critical to preserving and improving the health of those communities. We propose a novel approach to identifying key members and their roles by discovering implicit knowledge from online communities. Viewing an online community as a social network connected by poster-poster relationships, the approach takes advantage of the strengths of social network analysis and weighting schemes from information retrieval in identifying key members. Experimental studies were carried out to empirically evaluate the proposed approach with real-world data collected from a Usenet bulletin board over a one year period. The results showed that the proposed approach can not only identify prominent members whose behaviors are community supportive but also filter chatters whose behaviors are superficial to the online community. The findings have broad implications for online communities by allowing moderators to better support their members and by enabling members to better understand the conversation space.
{"title":"Social computing and weighting to identify member roles in online communities","authors":"Robert D. Nolker, Lina Zhou","doi":"10.1109/WI.2005.134","DOIUrl":"https://doi.org/10.1109/WI.2005.134","url":null,"abstract":"As more and more people join online communities, the ability to better understand members' roles becomes critical to preserving and improving the health of those communities. We propose a novel approach to identifying key members and their roles by discovering implicit knowledge from online communities. Viewing an online community as a social network connected by poster-poster relationships, the approach takes advantage of the strengths of social network analysis and weighting schemes from information retrieval in identifying key members. Experimental studies were carried out to empirically evaluate the proposed approach with real-world data collected from a Usenet bulletin board over a one year period. The results showed that the proposed approach can not only identify prominent members whose behaviors are community supportive but also filter chatters whose behaviors are superficial to the online community. The findings have broad implications for online communities by allowing moderators to better support their members and by enabling members to better understand the conversation space.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432334","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}
Naoki Fukuta, T. Osawa, T. Iijima, Takahira Yamaguchi
In this paper, we propose an ontology-based framework that integrates existing Web applications into Web portals. The framework helps Web portal developers to discover, evaluate, and execute semantically composed services on the Web. Parameter passings on service composition are associated using service ontology. Semi-automated source code generation reduces the cost of system development. We show the proposed technologies are useful for constructing statically composed service integration system for current Web world.
{"title":"Semantic service integration support for Web portal","authors":"Naoki Fukuta, T. Osawa, T. Iijima, Takahira Yamaguchi","doi":"10.1109/WI.2005.131","DOIUrl":"https://doi.org/10.1109/WI.2005.131","url":null,"abstract":"In this paper, we propose an ontology-based framework that integrates existing Web applications into Web portals. The framework helps Web portal developers to discover, evaluate, and execute semantically composed services on the Web. Parameter passings on service composition are associated using service ontology. Semi-automated source code generation reduces the cost of system development. We show the proposed technologies are useful for constructing statically composed service integration system for current Web world.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114957889","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}
It is now widely accepted that formal methods are helpful for many issues raised in the Web services area. In this paper, we advocate the use of process algebra as a first step in the design and development of executable Web services. From such formal descriptions, reasoning tools can be used to validate their correct execution. We define some guidelines to encode abstract specifications of services-to-be written using these calculi into executable Web services. As a back-end language, we consider the standard orchestration language BPEL. We illustrate our approach through the development of an e-business application.
{"title":"Encoding abstract descriptions into executable Web services: towards a formal development","authors":"Antonella Chirichiello, Gwen Salaün","doi":"10.1109/WI.2005.59","DOIUrl":"https://doi.org/10.1109/WI.2005.59","url":null,"abstract":"It is now widely accepted that formal methods are helpful for many issues raised in the Web services area. In this paper, we advocate the use of process algebra as a first step in the design and development of executable Web services. From such formal descriptions, reasoning tools can be used to validate their correct execution. We define some guidelines to encode abstract specifications of services-to-be written using these calculi into executable Web services. As a back-end language, we consider the standard orchestration language BPEL. We illustrate our approach through the development of an e-business application.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"52 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124214355","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}
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the Web may be modeled as a digraph, such algorithms would not be of much use due to both the scale of the Web and the number of uninteresting cycles and sequences in it. We propose a novel sequence detection algorithm for Web pages, and highlight its importance for search related systems. Here, the sequence found is such that its consecutive elements have the same relation among them. This relation is measured in terms of the positional properties of navigational links, for which we provide a method for identifying navigational links. The proposed methodology does not detect all possible sequences and cycles in the Web graph, but just those that were intended by the creators of those Web pages. Experimental results confirm the accuracy of the proposed algorithm.
{"title":"Detecting sequences and cycles of Web pages","authors":"B. L. Narayan, S. Pal","doi":"10.1109/WI.2005.53","DOIUrl":"https://doi.org/10.1109/WI.2005.53","url":null,"abstract":"Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the Web may be modeled as a digraph, such algorithms would not be of much use due to both the scale of the Web and the number of uninteresting cycles and sequences in it. We propose a novel sequence detection algorithm for Web pages, and highlight its importance for search related systems. Here, the sequence found is such that its consecutive elements have the same relation among them. This relation is measured in terms of the positional properties of navigational links, for which we provide a method for identifying navigational links. The proposed methodology does not detect all possible sequences and cycles in the Web graph, but just those that were intended by the creators of those Web pages. Experimental results confirm the accuracy of the proposed algorithm.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"156 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732084","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}
As the number of Web services in repositories on the World Wide Web increases so do the number of complex configurations of Web services. However, as the World Wide Web is dynamic, Web services come and go, temporarily or for good. As a result, complex Web service configurations need to be reconfigured on demand. To this purpose, complex Web service configurations need to include local knowledge about (1) the function, structure and behaviour of each component in a configuration; and (2) the dependencies between components at each level of composition. Templates are proposed as a means to represent such knowledge. To illustrate the process of reconfiguration, an example is given of reconfiguration of a complex Web service, for which a template is used specifying both types of local knowledge.
{"title":"The role of local knowledge in complex Web service reconfiguration","authors":"S. V. Splunter, P. V. Langen, F. Brazier","doi":"10.1109/WI.2005.145","DOIUrl":"https://doi.org/10.1109/WI.2005.145","url":null,"abstract":"As the number of Web services in repositories on the World Wide Web increases so do the number of complex configurations of Web services. However, as the World Wide Web is dynamic, Web services come and go, temporarily or for good. As a result, complex Web service configurations need to be reconfigured on demand. To this purpose, complex Web service configurations need to include local knowledge about (1) the function, structure and behaviour of each component in a configuration; and (2) the dependencies between components at each level of composition. Templates are proposed as a means to represent such knowledge. To illustrate the process of reconfiguration, an example is given of reconfiguration of a complex Web service, for which a template is used specifying both types of local knowledge.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203375","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 work, we show that Kleinberg's hubs and authorities model (HITS) is simply principal components analysis (PCA; maybe the most widely used multivariate statistical analysis method), albeit without centering, applied to the adjacency matrix of the graph of Web pages. We further show that a variant of HITS, SALSA, is closely related to correspondence analysis, another standard multivariate statistical analysis method. In addition, to provide a clear statistical interpretation for HITS, this result suggests to rely on existing work already published in the multivariate statistical analysis literature (extensions of PCA or correspondence analysis) in order to analyse or design new Web pages scoring procedures.
{"title":"HITS is principal components analysis","authors":"M. Saerens, François Fouss","doi":"10.1109/WI.2005.71","DOIUrl":"https://doi.org/10.1109/WI.2005.71","url":null,"abstract":"In this work, we show that Kleinberg's hubs and authorities model (HITS) is simply principal components analysis (PCA; maybe the most widely used multivariate statistical analysis method), albeit without centering, applied to the adjacency matrix of the graph of Web pages. We further show that a variant of HITS, SALSA, is closely related to correspondence analysis, another standard multivariate statistical analysis method. In addition, to provide a clear statistical interpretation for HITS, this result suggests to rely on existing work already published in the multivariate statistical analysis literature (extensions of PCA or correspondence analysis) in order to analyse or design new Web pages scoring procedures.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"32 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125710218","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}
It has been well documented that Web searchers have difficulties crafting queries to fulfill their information needs. In this work, we use a concept knowledge base generated from the ACM computing classification system to generate a query space that represents the query terms in relation to the concepts they describe and the other terms that are related to these concepts. A visual representation of this query space allows the user to interpret the relationships between their query terms and the query space. Interactive query refinement within this visual representation takes advantage of the user's visual information processing abilities, and allows the user to choose terms that accurately represent their information need. A preview of the search results from Google provides the user with an indication of the current state of their query refinement process. This work allows the user to take an active role in the information retrieval process, supporting the fundamental shift from information retrieval systems to information retrieval support systems.
{"title":"Visualization support for interactive query refinement","authors":"O. Hoeber, X. Yang, Yiyu Yao","doi":"10.1109/WI.2005.158","DOIUrl":"https://doi.org/10.1109/WI.2005.158","url":null,"abstract":"It has been well documented that Web searchers have difficulties crafting queries to fulfill their information needs. In this work, we use a concept knowledge base generated from the ACM computing classification system to generate a query space that represents the query terms in relation to the concepts they describe and the other terms that are related to these concepts. A visual representation of this query space allows the user to interpret the relationships between their query terms and the query space. Interactive query refinement within this visual representation takes advantage of the user's visual information processing abilities, and allows the user to choose terms that accurately represent their information need. A preview of the search results from Google provides the user with an indication of the current state of their query refinement process. This work allows the user to take an active role in the information retrieval process, supporting the fundamental shift from information retrieval systems to information retrieval support systems.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125288542","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}
Organizations that own Web services participating in a workflow composition may evolve their components independently. Service coordination can fail when previously legal messages between independently changing, distributed components become illegal because their respective workflow models are no longer synchronized. This paper presents an intelligent-agent framework that wraps a Web service in a conversation layer and a simple workflow-adaptation function. The conversation layer implements protocols and consults globally shared, declarative policy specifications to resolve interaction failures. The framework allows agents to resolves various model mismatches that cause interaction errors, including changes to required preconditions, partners, and expected message ordering. Implications of this distributed approach to Web service coordination are also discussed.
{"title":"Conversation errors in Web service coordination: run-time detection and repair","authors":"Warren Blanchet, Renée Elio, Eleni Stroulia","doi":"10.1109/WI.2005.51","DOIUrl":"https://doi.org/10.1109/WI.2005.51","url":null,"abstract":"Organizations that own Web services participating in a workflow composition may evolve their components independently. Service coordination can fail when previously legal messages between independently changing, distributed components become illegal because their respective workflow models are no longer synchronized. This paper presents an intelligent-agent framework that wraps a Web service in a conversation layer and a simple workflow-adaptation function. The conversation layer implements protocols and consults globally shared, declarative policy specifications to resolve interaction failures. The framework allows agents to resolves various model mismatches that cause interaction errors, including changes to required preconditions, partners, and expected message ordering. Implications of this distributed approach to Web service coordination are also discussed.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129127977","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 show the design of MDSManager a system based on a multidatasource approach for data integration. MDSManager uses a multidatasource language called EXQ (extended XQuery). EXQ is designed in order to access and interconnect multiple conflicting static data sources (included databases, XML,HTML), and/or active data sources (included distinct services like Java classes, C programs, Web services etc.).
{"title":"MDSManager: a system based on multidatasource approach for data integration","authors":"G. Nachouki, M. Quafafou, Marie-Pierre Chastang","doi":"10.1109/WI.2005.93","DOIUrl":"https://doi.org/10.1109/WI.2005.93","url":null,"abstract":"In this paper, we show the design of MDSManager a system based on a multidatasource approach for data integration. MDSManager uses a multidatasource language called EXQ (extended XQuery). EXQ is designed in order to access and interconnect multiple conflicting static data sources (included databases, XML,HTML), and/or active data sources (included distinct services like Java classes, C programs, Web services etc.).","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374966","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}
Image retrieval on the Web requires that important (authoritative) images satisfying the query selection criteria are assigned higher ranking over other relevant images. PicASHOW (Lempel and Soffer, 2002) achieves this goal using link information alone. This work proposes WPicASHOW (weighted PicASHOW), a weighted scheme for co-citation analysis that incorporates within the link analysis method of PicASHOW the text and image content of the queries and of the Web pages. WPicASHOW is implemented and integrated into a fully automated Web retrieval system for logo and trademark images.
Web上的图像检索需要为满足查询选择标准的重要(权威)图像分配比其他相关图像更高的排名。PicASHOW (Lempel and Soffer, 2002)仅使用链接信息实现了这一目标。这项工作提出了WPicASHOW(加权PicASHOW)，这是一种用于共引分析的加权方案，在PicASHOW的链接分析方法中包含了查询和网页的文本和图像内容。WPicASHOW实现并集成到一个完全自动化的Web检索系统中，用于标识和商标图像。
{"title":"Weighted link analysis for logo and trademark image retrieval on the Web","authors":"Epimenidis Voutsakis, E. Petrakis, E. Milios","doi":"10.1109/WI.2005.162","DOIUrl":"https://doi.org/10.1109/WI.2005.162","url":null,"abstract":"Image retrieval on the Web requires that important (authoritative) images satisfying the query selection criteria are assigned higher ranking over other relevant images. PicASHOW (Lempel and Soffer, 2002) achieves this goal using link information alone. This work proposes WPicASHOW (weighted PicASHOW), a weighted scheme for co-citation analysis that incorporates within the link analysis method of PicASHOW the text and image content of the queries and of the Web pages. WPicASHOW is implemented and integrated into a fully automated Web retrieval system for logo and trademark images.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130833262","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
扫码关注我们
求助内容：
应助结果提醒方式：