The term of social network communities refers to groups of individuals within which social interactions are intense and between which they are weak. A social network community mining problem (SNCMP) can be stated as the problem of finding all such communities from a given social network. A wide variety of applications can be formulated into SNCMPs, ranging from Web intelligence to social intelligence. So far, many algorithms addressing the SNCMP have been developed; most of them are either optimization or heuristic based methods. Different from all existing work, this paper explores the notion of a social network community and its intrinsic properties, drawing on the dynamics of a stochastic model naturally introduced. In particular, it uncovers an interesting connection between the hierarchical community structure of a network and the metastability of a Markov process constructed upon it. A lot of critical topological information regarding to communities hidden in networks can be inferred from the derived spectral signatures of such networks, without actually clustering them with any particular algorithms. Based upon the above connection, we can obtain a framework for characterizing and analyzing social network communities.
{"title":"On Modularity of Social Network Communities: The Spectral Characterization","authors":"Bo Yang, Jiming Liu, Jianfeng Feng, Da-you Liu","doi":"10.1109/WIIAT.2008.70","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.70","url":null,"abstract":"The term of social network communities refers to groups of individuals within which social interactions are intense and between which they are weak. A social network community mining problem (SNCMP) can be stated as the problem of finding all such communities from a given social network. A wide variety of applications can be formulated into SNCMPs, ranging from Web intelligence to social intelligence. So far, many algorithms addressing the SNCMP have been developed; most of them are either optimization or heuristic based methods. Different from all existing work, this paper explores the notion of a social network community and its intrinsic properties, drawing on the dynamics of a stochastic model naturally introduced. In particular, it uncovers an interesting connection between the hierarchical community structure of a network and the metastability of a Markov process constructed upon it. A lot of critical topological information regarding to communities hidden in networks can be inferred from the derived spectral signatures of such networks, without actually clustering them with any particular algorithms. Based upon the above connection, we can obtain a framework for characterizing and analyzing social network communities.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133612171","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 page prefetching has been used efficiently to reduce the access latency problem of the Internet, its success mainly relies on the accuracy of Web page prediction. As powerful sequential learning models, conditional random fields (CRFs) have been used successfully to improve the Web page prediction accuracy when the total number of unique Web pages is small. However, because the training complexity of CRFs is quadratic to the number of labels, when applied to a Web site with a large number of unique pages, the training of CRFs may become very slow and even intractable. In this paper, we decrease the training time and computational resource requirements of CRFs training by integrating error correcting output coding (ECOC) method. Moreover, since the performance of ECOC-based methods crucially depends on the ECOC code matrix in use, we employ a coding method, search coding, to design the code matrix of good quality.
网页预取已被有效地用于降低互联网的访问延迟问题，其成功与否主要依赖于网页预测的准确性。条件随机场(conditional random field, CRFs)作为一种强大的序列学习模型，已被成功地用于提高网页总数较少时的网页预测精度。然而，由于crf的训练复杂度是标签数量的二次函数，当应用于具有大量唯一页面的Web站点时，crf的训练可能会变得非常缓慢甚至难以处理。本文通过集成纠错输出编码(ECOC)方法，减少了CRFs训练的训练时间和计算资源需求。此外，由于基于ECOC的方法的性能在很大程度上取决于所使用的ECOC代码矩阵，因此我们采用了一种编码方法，即搜索编码，来设计高质量的代码矩阵。
{"title":"Error Correcting Output Coding-Based Conditional Random Fields for Web Page Prediction","authors":"Y. Guo, K. Ramamohanarao, L. Park","doi":"10.1109/WIIAT.2008.148","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.148","url":null,"abstract":"Web page prefetching has been used efficiently to reduce the access latency problem of the Internet, its success mainly relies on the accuracy of Web page prediction. As powerful sequential learning models, conditional random fields (CRFs) have been used successfully to improve the Web page prediction accuracy when the total number of unique Web pages is small. However, because the training complexity of CRFs is quadratic to the number of labels, when applied to a Web site with a large number of unique pages, the training of CRFs may become very slow and even intractable. In this paper, we decrease the training time and computational resource requirements of CRFs training by integrating error correcting output coding (ECOC) method. Moreover, since the performance of ECOC-based methods crucially depends on the ECOC code matrix in use, we employ a coding method, search coding, to design the code matrix of good quality.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711713","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}
By feeding personal E-mails into the training set, personalized content-based spam filters are believed to classify e-mails in higher accuracy. However, filters trained by both spam mails and personal mails may have difficulty classifying e-mails with the same characteristics of both spam and ham. In this paper, we propose a two-tier approach of using two filters trained only with either personal mails or spam mails. E-mails classified as legitimate mails by the legitimate mail filter may pass, while the remaining e-mails are processed by the spam filter in an ordinary way. Experiments in this paper are performed on two mail servers-one equipped with ordinary spam filter, and the other equipped both the legitimate mail filter and the spam filter. By combining the two filters with tuned thresholds, a much lower false positive rate is observed under the same false negative rate comparing to the ordinary filter.
{"title":"A Personalized Spam Filtering Approach Utilizing Two Separately Trained Filters","authors":"W. Teng, W. Teng","doi":"10.1109/WIIAT.2008.257","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.257","url":null,"abstract":"By feeding personal E-mails into the training set, personalized content-based spam filters are believed to classify e-mails in higher accuracy. However, filters trained by both spam mails and personal mails may have difficulty classifying e-mails with the same characteristics of both spam and ham. In this paper, we propose a two-tier approach of using two filters trained only with either personal mails or spam mails. E-mails classified as legitimate mails by the legitimate mail filter may pass, while the remaining e-mails are processed by the spam filter in an ordinary way. Experiments in this paper are performed on two mail servers-one equipped with ordinary spam filter, and the other equipped both the legitimate mail filter and the spam filter. By combining the two filters with tuned thresholds, a much lower false positive rate is observed under the same false negative rate comparing to the ordinary filter.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133131113","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 how to use the agent modeling language (AMOLA) to define agent interaction protocols and how to integrate these in an agent model. AMOLA provides the syntax and semantics for creating models of multi-agent systems covering the analysis and design phases of a software development process. It supports a modular agent design approach and introduces the concepts of intra-and inter-agent control. The first defines the agentpsilas lifecycle by coordinating the different modules that implement his capabilities, while the latter defines the protocols that govern the coordination of the society of the agents. The modeling of the intra and inter-agent control is based on statecharts. The analysis phase builds on the concepts of capability and functionality. AMOLA deals with both the individual and societal aspect of the agents showing how protocols and capabilities can be integrated in agents design.
{"title":"An Agent Modeling Language Implementing Protocols through Capabilities","authors":"Nikolaos I. Spanoudakis, Pavlos Moraitis","doi":"10.1109/WIIAT.2008.343","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.343","url":null,"abstract":"In this paper we present how to use the agent modeling language (AMOLA) to define agent interaction protocols and how to integrate these in an agent model. AMOLA provides the syntax and semantics for creating models of multi-agent systems covering the analysis and design phases of a software development process. It supports a modular agent design approach and introduces the concepts of intra-and inter-agent control. The first defines the agentpsilas lifecycle by coordinating the different modules that implement his capabilities, while the latter defines the protocols that govern the coordination of the society of the agents. The modeling of the intra and inter-agent control is based on statecharts. The analysis phase builds on the concepts of capability and functionality. AMOLA deals with both the individual and societal aspect of the agents showing how protocols and capabilities can be integrated in agents design.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817396","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}
To be successful in multi-attribute auction, agents must be capable of adapting to continuous changing bidding price. This paper presents a novel fuzzy attitude based bidding strategy (FA-Bid), which employs dual assessment technique i.e. assessment of multiple attributes of the goods as well as assessment of agents attitude (eagerness) to procure an item in automated auction. The assessment of attributes adapts the fuzzy sets technique to handle uncertainty of the bidding process as well use heuristic rules to determine attitude of bidding agents in simulated auctions to procure goods. The overall assessment is used to determine a price range based on current bid, which finally selects the best one as the new bid.
{"title":"Using Agent's Eagerness and Competition in Automated Bidding Strategy","authors":"M. Goyal, Jun Ma","doi":"10.1109/WIIAT.2008.303","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.303","url":null,"abstract":"To be successful in multi-attribute auction, agents must be capable of adapting to continuous changing bidding price. This paper presents a novel fuzzy attitude based bidding strategy (FA-Bid), which employs dual assessment technique i.e. assessment of multiple attributes of the goods as well as assessment of agents attitude (eagerness) to procure an item in automated auction. The assessment of attributes adapts the fuzzy sets technique to handle uncertainty of the bidding process as well use heuristic rules to determine attitude of bidding agents in simulated auctions to procure goods. The overall assessment is used to determine a price range based on current bid, which finally selects the best one as the new bid.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644805","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}
S. Konno, Y. Manabe, S. Fujita, K. Sugawara, Tetsuo Kinoshita, N. Shiratori
Recently, the research for the system to recognize user's intention, action and satisfaction rating by combining sensor data and knowledge, and provide the user with high-satisfactory service is advanced. In this paper, we propose a framework for perceptual functions of symbiotic computing. The perceptual function is generated the awareness corresponding to the application from the sensor data. And the awareness is necessary in order to understand the user's intention, action and satisfaction rating. The perceptual function chooses the necessary one from various and huge time-series data collected by the sensor network. And, a necessary awareness is refined and generated through a lot of steps in cooperation with other perceptual functions according to the request of the application. In this paper, we design perceptual function framework and experimental system for teleworker.
{"title":"A Framework for Perceptual Functions of Symbiotic Computing","authors":"S. Konno, Y. Manabe, S. Fujita, K. Sugawara, Tetsuo Kinoshita, N. Shiratori","doi":"10.1109/WIIAT.2008.298","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.298","url":null,"abstract":"Recently, the research for the system to recognize user's intention, action and satisfaction rating by combining sensor data and knowledge, and provide the user with high-satisfactory service is advanced. In this paper, we propose a framework for perceptual functions of symbiotic computing. The perceptual function is generated the awareness corresponding to the application from the sensor data. And the awareness is necessary in order to understand the user's intention, action and satisfaction rating. The perceptual function chooses the necessary one from various and huge time-series data collected by the sensor network. And, a necessary awareness is refined and generated through a lot of steps in cooperation with other perceptual functions according to the request of the application. In this paper, we design perceptual function framework and experimental system for teleworker.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134495582","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 asynchronous distributed atomic commit protocols use a coordinator, either an application server or an elected database server, to handle the progress of a transaction. When the coordinator fails or the network becomes partitioned, the transaction may block or may suffer from a split brain syndrome. In this paper we propose a decentralized, collaborative, non-blocking atomic protocol, which piggybacks transaction statuses of all transaction participants onto tokens, and passes the tokens in a logical ring with two distinct directions. Each participant uses the information in the tokens to make a decision of when to go to the next state. Using the state vectors in the tokens, the transaction can progress even if the network is partitioned, and the protocol will ensure uniform agreement on success or failure of the transaction.
{"title":"A Ring-Based Decentralized Collaborative Non-blocking Atomic Commit Protocol","authors":"Chun-Yao Wang, D. Buehrer","doi":"10.1109/WIIAT.2008.26","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.26","url":null,"abstract":"Many asynchronous distributed atomic commit protocols use a coordinator, either an application server or an elected database server, to handle the progress of a transaction. When the coordinator fails or the network becomes partitioned, the transaction may block or may suffer from a split brain syndrome. In this paper we propose a decentralized, collaborative, non-blocking atomic protocol, which piggybacks transaction statuses of all transaction participants onto tokens, and passes the tokens in a logical ring with two distinct directions. Each participant uses the information in the tokens to make a decision of when to go to the next state. Using the state vectors in the tokens, the transaction can progress even if the network is partitioned, and the protocol will ensure uniform agreement on success or failure of the transaction.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127403703","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}
This paper proposes an integrated approach for personal name recognition (PNR) in Chinese by utilizing both statistical language models and categorized linguistic knowledge. Various formulas are proposed for calculating personal name credibility and context credibility for different types of personal names. Experiment is conducted on large-scale corpus to evaluate the approach and the F-1 scores has reached 98.85% and 92.73% respectively in close and open test.
{"title":"Personal Name Recognition Based on Categorized Linguistic Knowledge","authors":"Weiguang Qu, Xuri Tang, Bin Li","doi":"10.1109/WIIAT.2008.155","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.155","url":null,"abstract":"This paper proposes an integrated approach for personal name recognition (PNR) in Chinese by utilizing both statistical language models and categorized linguistic knowledge. Various formulas are proposed for calculating personal name credibility and context credibility for different types of personal names. Experiment is conducted on large-scale corpus to evaluate the approach and the F-1 scores has reached 98.85% and 92.73% respectively in close and open test.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133736623","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}
Todays' WUM techniques allow to perform the mining process based on lists of words, stems, and visitors' sessions. Although, results are (generally) far from visitors' real goals or motivations when browsing a web site. Thus, extraction of useful modifications of site organization or contents are difficult to obtain. It is needed a way to enhance the WUM process, to allow better results, closer to visitors' real preferences and goals. It was developed a Semantic WUM process, which uses a concept-based approach to add semantics into the mining process. The solution proposed, was applied to a real web site to produce off-line enhancements of contents and structure. The method was compared with four different WUM methods. Afterwards, the quality of enhancements was evaluated using a survey to 100 subjects, proving the effectiveness of the proposal.
{"title":"Semantic Web Usage Mining by a Concept-Based Approach for Off-line Web Site Enhancements","authors":"Sebastián A. Ríos, J. D. Velásquez","doi":"10.1109/WIIAT.2008.406","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.406","url":null,"abstract":"Todays' WUM techniques allow to perform the mining process based on lists of words, stems, and visitors' sessions. Although, results are (generally) far from visitors' real goals or motivations when browsing a web site. Thus, extraction of useful modifications of site organization or contents are difficult to obtain. It is needed a way to enhance the WUM process, to allow better results, closer to visitors' real preferences and goals. It was developed a Semantic WUM process, which uses a concept-based approach to add semantics into the mining process. The solution proposed, was applied to a real web site to produce off-line enhancements of contents and structure. The method was compared with four different WUM methods. Afterwards, the quality of enhancements was evaluated using a survey to 100 subjects, proving the effectiveness of the proposal.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124139776","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}
Except in very controlled or fortuitous circumstances, good coordination between agents does not spontaneously occur. In general, agents need to plan for coordination, anticipating how their activities can affect each other and choosing actions that dovetail well together to achieve their separate and common goals. Of course, this is easier said than done, since the potential space of agents' action and interaction sequences to consider is intractable. I discuss some technologies that make it practical to plan for good coordination by exploiting algorithmic, representational, and problem-specific structure. Furthermore, when conducted by the involved agents, the processes for planning coordination need to be coordinated themselves. Toward this end, I also outline meta-level strategies for coordinating the agents' planning processes.
{"title":"Planning for Coordination and Coordination for Planning","authors":"E. Durfee","doi":"10.1109/WIIAT.2008.389","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.389","url":null,"abstract":"Except in very controlled or fortuitous circumstances, good coordination between agents does not spontaneously occur. In general, agents need to plan for coordination, anticipating how their activities can affect each other and choosing actions that dovetail well together to achieve their separate and common goals. Of course, this is easier said than done, since the potential space of agents' action and interaction sequences to consider is intractable. I discuss some technologies that make it practical to plan for good coordination by exploiting algorithmic, representational, and problem-specific structure. Furthermore, when conducted by the involved agents, the processes for planning coordination need to be coordinated themselves. Toward this end, I also outline meta-level strategies for coordinating the agents' planning processes.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124401618","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
扫码关注我们
求助内容：
应助结果提醒方式：