In this paper, with the objective to retrieving digital collections more intuitively and flexible, we proposed an approach of image-based digital collection retrieval on Web based on compact perception features. For this, the eigen and difference SGLD (space gray level dependence) matrices were used to extract the features of images. The associations of the extracted features with the human imagery, which can be described by the semantic, color, and structural characteristics, were analyzed. On this basis, the system of flexible image retrieval with human like performance was implemented on Web, which retrieved images by the flexible combination of query-by-sample, query-by-perception words, or query-by-impression words, and re-ranked retrieved images according to the adjustment of individual's similarity criteria threshold. The user satisfaction-based evaluation illustrated the good performance of the proposed system.
{"title":"Imagery-based digital collection retrieval on Web using compact perception features","authors":"Ying Dai, D. Cai","doi":"10.1109/WI.2005.72","DOIUrl":"https://doi.org/10.1109/WI.2005.72","url":null,"abstract":"In this paper, with the objective to retrieving digital collections more intuitively and flexible, we proposed an approach of image-based digital collection retrieval on Web based on compact perception features. For this, the eigen and difference SGLD (space gray level dependence) matrices were used to extract the features of images. The associations of the extracted features with the human imagery, which can be described by the semantic, color, and structural characteristics, were analyzed. On this basis, the system of flexible image retrieval with human like performance was implemented on Web, which retrieved images by the flexible combination of query-by-sample, query-by-perception words, or query-by-impression words, and re-ranked retrieved images according to the adjustment of individual's similarity criteria threshold. The user satisfaction-based evaluation illustrated the good performance of the proposed system.","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":"134409472","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}
Web services have emerged as a new paradigm that supports loosely-coupled distributed systems in service discovery and service execution. Next generation Web services evolve from performing static invocations to engaging in flexible interactions and negotiations for dynamic resource procurement. To this end, this paper applies an agent-oriented based approach over a Web service language, WS-Agreement, in order to facilitate conversations of sufficient expressiveness between adaptive and autonomous services. We discuss how such agent Web service agreements can be implemented over IBM's emerging technologies toolkit (ETTK) that itself includes an implementation of the WS-Agreement specification.
{"title":"Developing agent Web service agreements","authors":"S. Paurobally, N. Jennings","doi":"10.1109/WI.2005.54","DOIUrl":"https://doi.org/10.1109/WI.2005.54","url":null,"abstract":"Web services have emerged as a new paradigm that supports loosely-coupled distributed systems in service discovery and service execution. Next generation Web services evolve from performing static invocations to engaging in flexible interactions and negotiations for dynamic resource procurement. To this end, this paper applies an agent-oriented based approach over a Web service language, WS-Agreement, in order to facilitate conversations of sufficient expressiveness between adaptive and autonomous services. We discuss how such agent Web service agreements can be implemented over IBM's emerging technologies toolkit (ETTK) that itself includes an implementation of the WS-Agreement specification.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"11 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":"121151733","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}
The convenience of the Web equipped with automatic search engines attracts "focused learners" for learning about a new subject of interest. The resources recommended by a search engine are, however, often a collection of links to other resources, or commercial-driven, irrelevant, misleading pages. Subsequently, the learner needs to manually click through numerous pages to find quality resources. This paper proposes an approach to a new problem of mining the most suitable resources for one-stop learning, called "highly authoritative resources." The experimental results using top search results from Google and Yahoo for various subjects show that the proposed algorithm is highly effective both in quality and time.
{"title":"Mining highly authoritative Web resources for one-stop learning","authors":"SeungJin Lim, Youngrae Ko","doi":"10.1109/WI.2005.97","DOIUrl":"https://doi.org/10.1109/WI.2005.97","url":null,"abstract":"The convenience of the Web equipped with automatic search engines attracts \"focused learners\" for learning about a new subject of interest. The resources recommended by a search engine are, however, often a collection of links to other resources, or commercial-driven, irrelevant, misleading pages. Subsequently, the learner needs to manually click through numerous pages to find quality resources. This paper proposes an approach to a new problem of mining the most suitable resources for one-stop learning, called \"highly authoritative resources.\" The experimental results using top search results from Google and Yahoo for various subjects show that the proposed algorithm is highly effective both in quality and time.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"58 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":"121456025","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}
Over the last years, we have witnessed an explosive growth of e-learning. More and more learning contents have been published and shared over the Internet. Therefore, how to progress an efficient learning process becomes a critical issue. This paper proposes a sequential mining algorithm to analyze learning behaviors for discovering frequent sequential patterns. By these patterns, we can provide suggestions for learners to select their interest learning contents. Different to other sequential mining algorithms, this study provides an incrementally method to analyze learning sequencing. More specifically, the mining algorithm in this paper can provide real-time analysis, and then report to learners for selecting learning contents more easily.
{"title":"Real-time learning behavior mining for e-learning","authors":"Yen-Hung Kuo, Juei-Nan Chen, Yu-Lin Jeng, Yueh-Min Huang","doi":"10.1109/WI.2005.125","DOIUrl":"https://doi.org/10.1109/WI.2005.125","url":null,"abstract":"Over the last years, we have witnessed an explosive growth of e-learning. More and more learning contents have been published and shared over the Internet. Therefore, how to progress an efficient learning process becomes a critical issue. This paper proposes a sequential mining algorithm to analyze learning behaviors for discovering frequent sequential patterns. By these patterns, we can provide suggestions for learners to select their interest learning contents. Different to other sequential mining algorithms, this study provides an incrementally method to analyze learning sequencing. More specifically, the mining algorithm in this paper can provide real-time analysis, and then report to learners for selecting learning contents more easily.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"78 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":"128938075","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}
Web personalization is one of the major concerns of Web intelligence. It is noticed that the two components of Web, users and services, can be understood from multiple views in forms of hierarchies, and each hierarchy is organized by a multilevel structure. A unified model is proposed for including all personalization styles. The unified model with multilevel hierarchy structures, add new understandings and insights into the Web personalization issues. More concise and precise recommendations can then be studied and pursued based on this multilevel model.
{"title":"Multilevel Web personalization","authors":"Yan Zhao, Yiyu Yao, N. Zhong","doi":"10.1109/WI.2005.105","DOIUrl":"https://doi.org/10.1109/WI.2005.105","url":null,"abstract":"Web personalization is one of the major concerns of Web intelligence. It is noticed that the two components of Web, users and services, can be understood from multiple views in forms of hierarchies, and each hierarchy is organized by a multilevel structure. A unified model is proposed for including all personalization styles. The unified model with multilevel hierarchy structures, add new understandings and insights into the Web personalization issues. More concise and precise recommendations can then be studied and pursued based on this multilevel model.","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":"128966466","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}
The combination of large data set size, geographic distribution of resources and users, and sophisticated applications on data and information needs robust infrastructures. In this paper, knowledge management sphere (KMSphere) is proposed and developed to explore important aspects of service-oriented and ontology-driven knowledge management on the grid. The main idea of KMSphere is to integrate ontologies with a service-oriented grid, build a knowledge space on top of databases, and then organize, utilize, and manage the knowledge resources in that space.
{"title":"Ontology-driven knowledge management on the grid","authors":"He Huang, Zhongzhi Shi, L. Qiu, Yong Cheng","doi":"10.1109/WI.2005.109","DOIUrl":"https://doi.org/10.1109/WI.2005.109","url":null,"abstract":"The combination of large data set size, geographic distribution of resources and users, and sophisticated applications on data and information needs robust infrastructures. In this paper, knowledge management sphere (KMSphere) is proposed and developed to explore important aspects of service-oriented and ontology-driven knowledge management on the grid. The main idea of KMSphere is to integrate ontologies with a service-oriented grid, build a knowledge space on top of databases, and then organize, utilize, and manage the knowledge resources in that space.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"22 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":"128466133","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}
The grid is considered as a crucial technology for the future knowledge-based economy and science. The Wisdom Grid project (a joint research effort of the University of Vienna and the Vienna University of Technology) aims, as the first research effort, to cover all aspects of the knowledge life cycle on the grid - from discovery in grid data repositories, to processing, sharing and finally reusing of knowledge as input for a new discovery. This paper first outlines the architecture of the Wisdom Grid infrastructure and then focuses on the kernel architecture component called Grid-Miner, which realizes the knowledge discovery, based on data mining and on-line analytical processing (OLAP) in grid repositories. A running GridMiner prototype is already available to the scientific community as an open service system.
{"title":"GridMiner: a fundamental infrastructure for building intelligent grid systems","authors":"P. Brezany, I. Janciak","doi":"10.1109/WI.2005.68","DOIUrl":"https://doi.org/10.1109/WI.2005.68","url":null,"abstract":"The grid is considered as a crucial technology for the future knowledge-based economy and science. The Wisdom Grid project (a joint research effort of the University of Vienna and the Vienna University of Technology) aims, as the first research effort, to cover all aspects of the knowledge life cycle on the grid - from discovery in grid data repositories, to processing, sharing and finally reusing of knowledge as input for a new discovery. This paper first outlines the architecture of the Wisdom Grid infrastructure and then focuses on the kernel architecture component called Grid-Miner, which realizes the knowledge discovery, based on data mining and on-line analytical processing (OLAP) in grid repositories. A running GridMiner prototype is already available to the scientific community as an open service system.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"314 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":"116910108","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}
Most keyword search engines return directly matching keyword phrases. However, publishers cannot anticipate all possible ways in which users would search for the items in their documents. In fact, many times, there may be no direct keyword match between a keyword search phrase and descriptions of relevant items that are perfect matches for the search. We present an automated, high precision-based information retrieval solution to boost item find-ability by bridging the semantic gap between item information and popular keyword search phrases. Our solution achieves an average of 80% F-measure for various boosted matches for keyword search phrases in various categories.
{"title":"Boosting item keyword search with spreading activation","authors":"D. Aswath, S. Ahmed, James D'cunha, H. Davulcu","doi":"10.1109/WI.2005.44","DOIUrl":"https://doi.org/10.1109/WI.2005.44","url":null,"abstract":"Most keyword search engines return directly matching keyword phrases. However, publishers cannot anticipate all possible ways in which users would search for the items in their documents. In fact, many times, there may be no direct keyword match between a keyword search phrase and descriptions of relevant items that are perfect matches for the search. We present an automated, high precision-based information retrieval solution to boost item find-ability by bridging the semantic gap between item information and popular keyword search phrases. Our solution achieves an average of 80% F-measure for various boosted matches for keyword search phrases in various categories.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"75 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":"127230531","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 present the software architecture of a new generation of advisory systems using intelligent agent and semantic Web technologies. Software agents act as clients and advisors to implement negotiation processes in a consultancy situation. The domain knowledge is modeled with the OWL ontology language. Using an inference engine the agents reason on base of their knowledge to make decisions or proposals. The agent knowledge consists of private data and publicly accessible knowledge spread over different Web sites. As in a real consultancy an agent only reveals sensitive private data, if it is indispensable for finding a solution. Depending on the actual consultancy situation each agent dynamically expands its knowledge base by accessing OWL knowledge sources from the Internet.
{"title":"Software architecture of advisory systems using agent and semantic Web technologies","authors":"J. Dunkel, Ralf Bruns","doi":"10.1109/WI.2005.135","DOIUrl":"https://doi.org/10.1109/WI.2005.135","url":null,"abstract":"In this paper, we present the software architecture of a new generation of advisory systems using intelligent agent and semantic Web technologies. Software agents act as clients and advisors to implement negotiation processes in a consultancy situation. The domain knowledge is modeled with the OWL ontology language. Using an inference engine the agents reason on base of their knowledge to make decisions or proposals. The agent knowledge consists of private data and publicly accessible knowledge spread over different Web sites. As in a real consultancy an agent only reveals sensitive private data, if it is indispensable for finding a solution. Depending on the actual consultancy situation each agent dynamically expands its knowledge base by accessing OWL knowledge sources from the Internet.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"38 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":"127410000","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}
Many real-world network systems demonstrate the small world phenomenon. The applicability of these systems depends on efficient decentralized techniques to search and retrieve data. In this paper, we propose an INquiry-based FOrwarding (INFO) strategy to search the small world networks. When a node initiates a search with the INFO strategy, it first sends an inquiry message to all its neighbors. This message requires each neighbor to recommend a candidate node which is the closest node to the destination in its own neighborhood. After receiving the neighbors' replies, the source will pick the closest one to the destination among the candidates and forward the search task to that node. The INFO strategy can decide search directions more globally than the traditional neighborhood-based greedy strategy. Experiments show that this strategy can find a path with shorter length to reach the destination.
{"title":"INFO: an improving strategy for searching the small world networks","authors":"Yi Tang, Liankuan Zhang","doi":"10.1109/WI.2005.76","DOIUrl":"https://doi.org/10.1109/WI.2005.76","url":null,"abstract":"Many real-world network systems demonstrate the small world phenomenon. The applicability of these systems depends on efficient decentralized techniques to search and retrieve data. In this paper, we propose an INquiry-based FOrwarding (INFO) strategy to search the small world networks. When a node initiates a search with the INFO strategy, it first sends an inquiry message to all its neighbors. This message requires each neighbor to recommend a candidate node which is the closest node to the destination in its own neighborhood. After receiving the neighbors' replies, the source will pick the closest one to the destination among the candidates and forward the search task to that node. The INFO strategy can decide search directions more globally than the traditional neighborhood-based greedy strategy. Experiments show that this strategy can find a path with shorter length to reach the destination.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"23 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":"122011190","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
扫码关注我们
求助内容：
应助结果提醒方式：