发布求助
文献互助 智能选刊 最新文献

IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)最新文献

筛选
英文 中文
B2Rank: An Algorithm for Ranking Blogs Based on Behavioral Features B2Rank:基于行为特征的博客排名算法
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.28
Ljiljana Stojanović, N. Stojanović, Jun Ma Fzi, Ljiljana Stojanović, N. Stojanović, Jun Ma
{"title":"B2Rank: An Algorithm for Ranking Blogs Based on Behavioral Features","authors":"Ljiljana Stojanović, N. Stojanović, Jun Ma Fzi, Ljiljana Stojanović, N. Stojanović, Jun Ma","doi":"10.1109/WI.2007.28","DOIUrl":"https://doi.org/10.1109/WI.2007.28","url":null,"abstract":"Blogs have become one of most important parts of web but we do not have so efficient search engines for them. One reason is differences between regular web pages and blog pages and inefficiency of conventional web pages ranking algorithms for blogs ranking. There are some works in this field but users' behavioral features have not considered yet. In this paper we present a new blogs ranking algorithm called B2Rank based on these features.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124816414","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}
引用次数: 26
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues 网站子网站的检测:概念、算法和评估问题
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.44
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B. Fortuna
{"title":"Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues","authors":"Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B. Fortuna","doi":"10.1109/WI.2007.44","DOIUrl":"https://doi.org/10.1109/WI.2007.44","url":null,"abstract":"Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user's perspective, these regions typically form coherent sets of pages characterized by a distinct navigation structure and page layout-we refer to them as subsites. In this paper we propose to characterize Web site structure as a collection of subsites and devise a method for detecting subsites and entry points for subsite navigation. In our approach we use a new model for representing Web site structure called Link Structure Graph (LSG). The LSG captures a complete hyperlink structure of a Web site and models link associations reflected in the page layout. We analyze a sample of Web sites and compare the LSG based approach to commonly used statistics for Web graph analysis. We demonstrate that LSG approach reveals site properties that are beyond the reach of standard site models. Furthermore, we devise a method for evaluating the performance of subsite detection algorithms and provide evaluation guidelines.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125592820","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}
引用次数: 21
PHASES: A User Profile Learning Approach for Web Search 阶段:一种用于网络搜索的用户概要学习方法
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.146
A. Eckhardt, Tomáš Horváth, P. Vojtás
{"title":"PHASES: A User Profile Learning Approach for Web Search","authors":"A. Eckhardt, Tomáš Horváth, P. Vojtás","doi":"10.1109/WI.2007.146","DOIUrl":"https://doi.org/10.1109/WI.2007.146","url":null,"abstract":"Web search heuristics based on Fagin 's threshold algorithm assume we have the user profile in the form of particular attribute ordering and a fuzzy aggregation function representing the user combining function. Having these, there are sufficient algorithms for searching top-k answers. Finding particular attribute ordering and aggregation for a user still remains a problem. In this short paper our main contribution is a proof of concept of a new iterative process of acquisition of user preferences and attribute ordering.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967442","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}
引用次数: 20
Using Information Filtering in Web Data Mining Process 信息过滤在Web数据挖掘中的应用
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.106
Xujuan Zhou, Yuefeng Li, P. Bruza, Sheng-Tang Wu, Yue Xu, Raymond Y. K. Lau
{"title":"Using Information Filtering in Web Data Mining Process","authors":"Xujuan Zhou, Yuefeng Li, P. Bruza, Sheng-Tang Wu, Yue Xu, Raymond Y. K. Lau","doi":"10.1109/WI.2007.106","DOIUrl":"https://doi.org/10.1109/WI.2007.106","url":null,"abstract":"The amount of Web information is growing rapidly, improving the efficiency and accuracy of Web information retrieval is uphill battle. There are two fundamental issues regarding the effectiveness of Web information gathering: information mismatch and overload. To tackle these difficult issues, an integrated information filtering and sophisticated data processing model has been presented in this paper. In the first phase of the proposed scheme, an information filter that based on user search intents was incorporated in Web search process to quickly filter out irrelevant data. In the second data processing phase, a pattern taxonomy model (PTM) was carried out using the reduced data. PTM rationalizes the data relevance by applying data mining techniques that involves more rigorous computations. Several experiments have been conducted and the results show that more effective and efficient access Web information has been achieved using the new scheme.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130142385","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}
引用次数: 26
Text Feature Ranking Based on Rough-set Theory 基于粗糙集理论的文本特征排序
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.150
Songbo Tan, Yuefen Wang, Xueqi Cheng
{"title":"Text Feature Ranking Based on Rough-set Theory","authors":"Songbo Tan, Yuefen Wang, Xueqi Cheng","doi":"10.1109/WI.2007.150","DOIUrl":"https://doi.org/10.1109/WI.2007.150","url":null,"abstract":"With the aim to reduce the dimensionality without sacrificing classification performance, the author gains insights from attribute reduction based on discernibility matrix in rough-set theory and proposes two text feature selection algorithms, i.e., DB1 and DB2. The experimental results indicate that DB2 not only yields much higher accuracy than information gain when the number of features is smaller than 6000, but also incurs much smaller CPU time than information gain.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115704540","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}
引用次数: 10
Online Search Scope Reconstruction by Connectivity Inference 基于连通性推理的在线搜索范围重构
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.142
Michael Chan, Stephen Chi-fai Chan, C. Leung
{"title":"Online Search Scope Reconstruction by Connectivity Inference","authors":"Michael Chan, Stephen Chi-fai Chan, C. Leung","doi":"10.1109/WI.2007.142","DOIUrl":"https://doi.org/10.1109/WI.2007.142","url":null,"abstract":"To cope with the continuing growth of the web, improvements should be made to the current brute-force techniques commonly used by robot-driven search engines. We propose a model that strikes a balance between robot and directory- based search engines by expanding the search scope of conventional directories to automatically include related categories. Our model makes use of a knowledge-rich and well- structured corpus to infer relationships between documents and topic categories. We show that the hyperlink structure ofWikipedia articles can be effectively exploited to identify relations among topic categories. Our experiments show the average recall rate and precision rate achieved are 91% and between 85% and 215% of Google's respectively.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039934","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}
引用次数: 0
Customizable Web Services Description, Discovery and Composition : An Attribute Based Formalism 可定制的Web服务描述、发现和组合:基于属性的形式化
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.42
Yacine Sam, Omar Boucelma
{"title":"Customizable Web Services Description, Discovery and Composition : An Attribute Based Formalism","authors":"Yacine Sam, Omar Boucelma","doi":"10.1109/WI.2007.42","DOIUrl":"https://doi.org/10.1109/WI.2007.42","url":null,"abstract":"We present in this article a theoretical framework for customizable Web services description, discovery and composition based on an attributive formalism.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116897735","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}
引用次数: 2
How Up-to-date should it be? the Value of Instant Profiling and Adaptation in Information Filtering 它的最新程度应该是多少?即时分析与自适应在信息过滤中的价值
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.135
Daqing He, Peter Brusiloviksy, Jonathan Grady, Qi Li, Jae-wook Ahn
{"title":"How Up-to-date should it be? the Value of Instant Profiling and Adaptation in Information Filtering","authors":"Daqing He, Peter Brusiloviksy, Jonathan Grady, Qi Li, Jae-wook Ahn","doi":"10.1109/WI.2007.135","DOIUrl":"https://doi.org/10.1109/WI.2007.135","url":null,"abstract":"In profile-based or content-based adaptive systems, one of the open research questions is how frequently the user's profile and the list of recommended items should be updated. Different systems tend to choose one of the two extremes. Some systems do it once per session (thus called between-session update strategy), whereas some others update whenever there is feedback (called instant update strategy). This paper presents our attempt to assess the value of keeping the list of recommended items up-to-date in the context of task-based information exploration. We conducted controlled studies involving human users performing realistic tasks using two systems that have the same adaptive filtering engine but with the above two different update strategies. Our results show that the between-session strategy helped to find better quality information, and received better subjects' responses about its usefulness and usability. However, it prolonged the selection of useful passages, whereas the instant update strategy helped subjects to obtain almost all of their selected passages (>98%) within the first 5 minutes. Based on the results, we hypothesize that the best strategy for updating might be a hybrid between the two update strategies, where both adaptability and stability can be achieved.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584430","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}
引用次数: 13
Wrapping VRXQuery with Self-Adaptive Fuzzy Capabilities 用自适应模糊能力包装VRXQuery
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.155
K. Kianmehr, Tansel Özyer, Mehmet Kaya, R. Alhajj
{"title":"Wrapping VRXQuery with Self-Adaptive Fuzzy Capabilities","authors":"K. Kianmehr, Tansel Özyer, Mehmet Kaya, R. Alhajj","doi":"10.1109/WI.2007.155","DOIUrl":"https://doi.org/10.1109/WI.2007.155","url":null,"abstract":"This paper addresses the development of a plug and run wrapper to incorporate fuzziness into VRXQuery, the querying facility of VIREX which is a user-friendly system for transforming and querying relational data as XML. Our basic argument is not to force the underlying XML data to incorporate fuzziness. Rather, fuzziness is smoothly supported in a novel plug and run manner via a wrapper. Either the user specifies the membership functions for the elements/attributes to be queried as fuzzy, or multi-objective genetic algorithm is used to automatically decide on and optimize the membership functions. The interface of VIREX has been expanded to allow specifying queries with fuzziness. Then, queries expressed in VRXQuery empowered with fuzziness are translated into corresponding XQuery code, which is run on the underlying XML and the returned result is translated into a fuzzy representation; translation into SQL is also possible. The user is given the choice to display the result either as colored- text or in graphical format.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617192","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}
引用次数: 11
Emotion Sensitive News Agent: An Approach Towards User Centric Emotion Sensing from the News 情感敏感新闻代理:以用户为中心的新闻情感感知方法
IEEE/WIC/ACM International Conference on Web Intelligence (WI'07) Pub Date : 2007-11-02 DOI: 10.1109/WI.2007.129
Hung-Yu Kao, Seng-Feng Lin
{"title":"Emotion Sensitive News Agent: An Approach Towards User Centric Emotion Sensing from the News","authors":"Hung-Yu Kao, Seng-Feng Lin","doi":"10.1109/WI.2007.129","DOIUrl":"https://doi.org/10.1109/WI.2007.129","url":null,"abstract":"This paper describes a character-based system called \"Emotion Sensitive News Agent\" (ESNA). ESNA is been developed as a news aggregator to fetch news from different news sources chosen by a user, and to categorize the themes of the news into eight emotion types. A small user study indicates that the system is conceived as intelligent and interesting as an affective interface. ESNA exemplifies a recent research agenda that aims at recognizing affective information conveyed through texts. News is an interesting application domain where user may have marked attitudes to certain events or entities reported about. Different approaches have already been employed to \"sense\" emotion from text. The novelty of our approach is twofold: affective information conveyed through text is analyzed (1) by considering the cognitive and appraisal structure of emotions, and (2) by taking into account user preferences.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"84 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443935","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}
引用次数: 104
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信