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

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

筛选
英文 中文
Big blackboard: on a large Web page by using a fast page loading method 大黑板:在一个大的网页上使用快速加载页面的方法
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.41
T. Konagaya, T. Shintani, Tadachika Ozono, Takayuki Ito, Kentaro Nishi
{"title":"Big blackboard: on a large Web page by using a fast page loading method","authors":"T. Konagaya, T. Shintani, Tadachika Ozono, Takayuki Ito, Kentaro Nishi","doi":"10.1109/WI.2005.41","DOIUrl":"https://doi.org/10.1109/WI.2005.41","url":null,"abstract":"Recently, the World Wide Web (WWW) has been attracting much attention as the predominant method of sharing information using multimedia contents. However, when users want to provide multimedia contents on the Web, they must learn how to use authoring software or how to write HTML documents. In this paper, we propose a Web information-sharing system called \"Big Blackboard\", which is based on a large Web page. The large Web page can act as a metaphor for real-world bulletin boards to realize not only a one-dimensional message board but also a two-dimensional message board on the Web. Any user can easily provide multimedia contents using unlimited layout through a Web browser without needing to know HTML. In the case of displaying on a large Web page, loading Web page contents onto a Web browser may require users to wait a long time. We propose a novel method that reduces transmission cost by only loading the contents within the scope at which a user is looking at an entire Web page. The experimental results demonstrate that our method can effectively reduce user waiting time for loading a Web page.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"71 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":"126661070","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
Efficient extraction of closed motivic patterns in multi-dimensional symbolic representations of music 音乐多维符号表征中封闭动机模式的高效提取
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/wi.2005.58
O. Lartillot
{"title":"Efficient extraction of closed motivic patterns in multi-dimensional symbolic representations of music","authors":"O. Lartillot","doi":"10.1109/wi.2005.58","DOIUrl":"https://doi.org/10.1109/wi.2005.58","url":null,"abstract":"An efficient model for discovering repeated patterns in symbolic representations of music is presented. Combinatorial redundancy inherent in the pattern discovery paradigm is commonly filtered using global selective mechanisms, based on pattern frequency and length. We propose an alternate approach founded on the concept of closed pattern and enabling detailed analyses through adaptive selection of most specific descriptions in a multidimensional parametric space. A notion of cyclic pattern is introduced, enabling an adapted filtering of another form of combinatorial redundancy caused by successive repetitions of patterns. The use of cyclic patterns implies a necessary chronological scanning of the piece, and the addition of mechanisms formalizing particular Gestalt principles. This study shows therefore that automated analysis of music cannot rely on simple mathematical or statistical approaches, but needs rather complex and detailed modeling of the cognitive system ruling listening processes. The resulting algorithm is able to offer for the first time compact and relevant motivic analyses of simple monodies, and may therefore be applied to automated indexing of symbolic music databases. Numerous additional mechanisms need to be added in order to consider all aspects of music expression, including polyphony and complex musical transformations.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"89 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":"126698739","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}
引用次数: 24
Establishing guidelines on how to improve the Web site content based on the identification of representative pages 根据代表性页面的识别，制定如何改进网站内容的指导方针
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.60
Sebastián A. Ríos, J. D. Velásquez, Eduardo S. Vera, H. Yasuda, T. Aoki
{"title":"Establishing guidelines on how to improve the Web site content based on the identification of representative pages","authors":"Sebastián A. Ríos, J. D. Velásquez, Eduardo S. Vera, H. Yasuda, T. Aoki","doi":"10.1109/WI.2005.60","DOIUrl":"https://doi.org/10.1109/WI.2005.60","url":null,"abstract":"The Internet has become a big battlefield where organizations are trying to keep their present clients and to gain new ones. Two important weapons that the organizations have are to make a good Web site design and to have a content interesting for the visitors. To improve the Web site content, many tools have been developed. However, it is hard to figure out how to apply these changes. Furthermore, in complex Web sites, this is a non trivial task. We propose a novel approach that helps to improve a Web site content using a SOFM and performing a reverse clustering analysis that allows us to gather the most representative Web pages from a Web site, using this small set of pages as a guideline of how these enhancements should be performed. The effectiveness of the method was tested in a real Web site.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"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":"133747673","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}
引用次数: 8
WISE: a visual tool for automatic extraction of objects from World Wide Web WISE:一个用于从万维网自动提取对象的可视化工具
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.167
Yi-Wei Jan, Jyh-Jong Tsay, B. Wu
{"title":"WISE: a visual tool for automatic extraction of objects from World Wide Web","authors":"Yi-Wei Jan, Jyh-Jong Tsay, B. Wu","doi":"10.1109/WI.2005.167","DOIUrl":"https://doi.org/10.1109/WI.2005.167","url":null,"abstract":"Automatic identification and extraction of interesting objects instead of just related Web pages is useful to users of the World Wide Web. For example, an instructor teaching a data mining course may be interested in finding all text books, lecture notes, slides, homeworks and term projects from Web pages of all data mining and their related courses. In this paper, we present a tool WISE for extraction of objects from Web pages, which are of interest. In WISE, objects in HTML pages are defined as nodes in an extension of DOM trees. Extraction of objects is then formulated as the problem of classification of tree nodes. We develop a mechanism for object specifications, and a specific-to-general (bottom-up) search algorithm for learning object specifications. Experiment shows that WISE works well for extracting objects such as, for example, extracting items in paper lists, and extracting lists of lecture notes in algorithms courses.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"3 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":"131260992","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}
引用次数: 1
A knowledge fusion model for Web information 面向Web信息的知识融合模型
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.4
N. Xie, C. Cao, H. Guo
{"title":"A knowledge fusion model for Web information","authors":"N. Xie, C. Cao, H. Guo","doi":"10.1109/WI.2005.4","DOIUrl":"https://doi.org/10.1109/WI.2005.4","url":null,"abstract":"The Web was designed as an information space by Tim Berners-Lee, with the goal not only that it should be available for human reading, but also that machine would be able to participate in and help users to communicate with each other. Web information integration can only free them from the tedious tasks of finding the relevant data sources. But the most existing systems do not really integrate information. Deeper information integration, or knowledge fusion (KF), involves not only delivering the information available via the links to user, but also analyzing, and merging the information results coming from information sources by solving the result consistencies, removing duplicates, etc. In the paper, we give a formal model for knowledge fusion for XML data and the KF-based information access architecture.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"49 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":"129238795","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}
引用次数: 14
Cache replacement for transcoding proxy caching 转码代理缓存的缓存替换
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.45
Keqiu Li, Keishi Tajima, Hong Shen
{"title":"Cache replacement for transcoding proxy caching","authors":"Keqiu Li, Keishi Tajima, Hong Shen","doi":"10.1109/WI.2005.45","DOIUrl":"https://doi.org/10.1109/WI.2005.45","url":null,"abstract":"In this paper, we address the problem of cache replacement for transcoding proxy caching. First, an efficient cache replacement algorithm is proposed. Our algorithm considers both the aggregate effect of caching multiple versions of the same multimedia object and cache consistency. Second, a complexity analysis is presented to show the efficiency of our algorithm. Finally, some preliminary simulation experiments are conducted to compare the performance of our algorithm with some existing algorithms. The results show that our algorithm outperforms others in terms of the various performance metrics.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"47 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":"115208953","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}
引用次数: 12
An efficient ontology comparison tool for semantic Web applications 一个有效的本体比较工具，用于语义Web应用程序
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.28
J. Wang, F. Ali
{"title":"An efficient ontology comparison tool for semantic Web applications","authors":"J. Wang, F. Ali","doi":"10.1109/WI.2005.28","DOIUrl":"https://doi.org/10.1109/WI.2005.28","url":null,"abstract":"With the growing access to heterogeneous and independent data repositories, determining the semantic difference of two ontologies is critical in information retrieval, information integration and semantic web applications. In this paper, we propose an ontology comparison tool based on a novel senses refinement algorithm, which builds a senses set to accurately represent the semantics of the input ontology. The senses refinement algorithm automatically extracts senses from the electronic lexical database WordNet (locally installed or online), removes unnecessary senses based on the relationship among the entity classes of the ontology, and specifies relations and constraints of the concepts in the refined senses set. The senses refinement converts the measurement of ontology difference into simple set operations based on set theory, thus ensures the efficiency and accuracy of the ontology comparison. Our experimental studies show that the proposed senses refinement algorithm outperforms the naive senses set construction algorithm in terms of efficiency and accuracy.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"48 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":"120955317","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}
引用次数: 22
A fuzzy Web surfer model 一个模糊网络冲浪者模型
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.3
B. L. Narayan, S. Pal
{"title":"A fuzzy Web surfer model","authors":"B. L. Narayan, S. Pal","doi":"10.1109/WI.2005.3","DOIUrl":"https://doi.org/10.1109/WI.2005.3","url":null,"abstract":"A novel Web surfer model, where the transitions between Web pages are fuzzy quantities, is proposed in this article. Such a model is appropriate when the links between pages are imprecise. The theoretical aspects of modeling the uncertainty associated with links are discussed. The advantages and limitations of the proposed methodology, which is based on the theory of fuzzy Markov chains, are described. Situations where fuzzy Web surfer models are appropriate compared to existing models are highlighted.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"282 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":"122948679","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}
引用次数: 1
Towards a semantics-based framework for KD- and IR-style resource querying on XML-based P2P information systems 基于xml的P2P信息系统中基于语义的KD和ir类型资源查询框架
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.149
A. Cuzzocrea
{"title":"Towards a semantics-based framework for KD- and IR-style resource querying on XML-based P2P information systems","authors":"A. Cuzzocrea","doi":"10.1109/WI.2005.149","DOIUrl":"https://doi.org/10.1109/WI.2005.149","url":null,"abstract":"A semantics-based framework for KD- and IR-style resource querying on XML-based P2P information systems is described in this paper. Particularly, we present and discuss in detail the XML data model and the knowledge representation model of such a framework, which are both based on the amenity of adding semantics to data. As main result, we obtain a collection of techniques that allows us to efficiently process XML-formatted knowledge in P2P IS.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"45 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":"117154443","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
Improving the effectiveness of model based recommender systems for highly sparse and noisy Web usage data 提高基于模型的推荐系统对高度稀疏和有噪声的Web使用数据的有效性
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) Pub Date : 2005-09-19 DOI: 10.1109/WI.2005.74
B. S. Suryavanshi, Nematollaah Shiri, S. Mudur
{"title":"Improving the effectiveness of model based recommender systems for highly sparse and noisy Web usage data","authors":"B. S. Suryavanshi, Nematollaah Shiri, S. Mudur","doi":"10.1109/WI.2005.74","DOIUrl":"https://doi.org/10.1109/WI.2005.74","url":null,"abstract":"A number of approaches which use model-based collaborative filtering (CF) for scalability in building recommendation systems in Web personalization have poor accuracy due to the fact that Web usage data is often sparse and noisy. Clustering, mining association rules, and sequence pattern discovery have been used to determine the access behavior model. Making use of some of the characteristics of the modeling process can provide significant improvements to recommendation effectiveness. In an earlier work, we introduced a fuzzy hybrid CF technique which inherits the advantages of both memory-based and model-based CF. In this paper, using relational fuzzy subtractive clustering as the first level modeling and then mining association rules within individual clusters, we propose a two level model-based technique, which is scalable and is an enhancement over association rule based recommender systems. Our results from comprehensive experiments using a large real life Web usage data and performance comparisons with memory-based and model-based approaches help substantiate this claim.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"76 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":"126818244","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}
引用次数: 18
首页 上一页
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学术官方微信