The World Wide Web contains rich textual contents that are interconnected via complex hyperlinks. Most studies on web community extraction only focus on graph structures. Consequently, web communities are discovered p...
详细信息
ISBN:
(纸本)9783642145889
The World Wide Web contains rich textual contents that are interconnected via complex hyperlinks. Most studies on web community extraction only focus on graph structures. Consequently, web communities are discovered purely in terms of explicit link information without considering textual properties of web pages. This paper proposes an improved algorithm based on Flake's method using the maximum flow algorithm. The improved algorithm considers the differences between edges in terms of importance, and assigns a well-designed capacity to each edge via the lexical similarity of web pages. Given a specific query, it also lends itself to a new and efficient ranking scheme for members in the extracted community. The experimental results indicate that our approach efficiently handles a variety of data sets across a novel optimization strategy of similarity computation.
Tasks scheduling is a key problem in multi-agent system, traditional tasks scheduling methods can't be applied to new application areas of the MAS such as emergency system. In order to apply agent method to these ...
详细信息
ISBN:
(纸本)9780769536187
Tasks scheduling is a key problem in multi-agent system, traditional tasks scheduling methods can't be applied to new application areas of the MAS such as emergency system. In order to apply agent method to these new areas, this paper proposes a new variant of task scheduling method considering utility. Based on our MAS model, we construct a flow network according to instance of task scheduling problem and add utility to it. We show that minimum cost flowalgorithm can be use to task scheduling problem to maximize the utility of the system. Moreover, we use a mathematical method to ensure tasks are schedulable when maximizing the utility. Finally, a conclusion which can be used to determine whether there exists an efficient task scheduling is gained.
WWW has grown rapidly in recent years which has enabled us to obtain much information on various fields. At the same time it is becoming difficult to obtain really relevant web pages on a specific topic. Therefore it ...
详细信息
ISBN:
(纸本)9780769535951
WWW has grown rapidly in recent years which has enabled us to obtain much information on various fields. At the same time it is becoming difficult to obtain really relevant web pages on a specific topic. Therefore it becomes very important today to extract web pages related to certain information topically. Recently it has become popular to call a collection of web pages sharing certain information as web community. Identifying good quality web community is still a challenging problem. Different notions and methods for identifying web communities have been proposed. In this paper we provide a frame work for identifying web communities using link based approaches. We have discussed and analyzed various link based approaches for identifying web communities. Based on extensive survey we have tried to identify problems/limitations of these approaches and discussed some extensions of these approaches.
A web community is a set of web pages that provide resources on a specific topic. Various methods for finding web communities based on link analysis have been proposed in the literature. The method proposed in this pa...
详细信息
A web community is a set of web pages that provide resources on a specific topic. Various methods for finding web communities based on link analysis have been proposed in the literature. The method proposed in this paper is based on the method using the maximum flow algorithm proposed in [7], [8]. Our objective of using the maximum flow algorithm is to extract a subgraph which can be recognized as a good web community in the context of the quantity and the quality. This paper first discusses the features of the maximum flow algorithm based method. The previously proposed approach has a problem that a certain graph structure containing noises (i.e., irrelevant pages) is always extracted. This problem is mainly caused by edge capacities assigned a constant value. This paper proposes an assignment of variable edge capacities that are based on hub and authority scores obtained from HITS calculation. To examine the effects of our proposed method, we performed experiments using a Japanese archive crawled in February 2002. Our experimental results demonstrate that our proposed method removes noise pages caused by constant edge capacities and improves the quality of web communities.
In this paper, we propose a method for detecting conserved domains from a set of amino acid sequences that belong to a protein family. This method detects the domains as follows: first, generate fixed-length subsequen...
详细信息
In this paper, we propose a method for detecting conserved domains from a set of amino acid sequences that belong to a protein family. This method detects the domains as follows: first, generate fixed-length subsequences from the sequences;second, construct a weighted graph that connects any two of the subsequences (vertices) having higher similarity than a pre-defined threshold;third, search for the maximum-density subgraph for each connected component of the graph;finally, explore conserved domains in the sequences by combining the results of the previous step. From the performance results obtained by applying the method to several protein families that have complex conserved domains, we found that our method was able to detect those domains even though some domains were weakly conserved.
In this paper, we present a hierarchical technique for simultaneous pin assignment and global routing during floorplanning based on the minimum cost maximum integer flowalgorithm with several heuristic cost functions...
详细信息
In this paper, we present a hierarchical technique for simultaneous pin assignment and global routing during floorplanning based on the minimum cost maximum integer flowalgorithm with several heuristic cost functions. Furthermore, our algorithm handles feedthrough pins and equi-potential pins taking into account global routes. Our algorithm allows various user specified constraints such as pre-specified pin positions, wiring paths, wiring widths and critical nets. Experimental results including Xerox floorplanning benchmark have shown the effectiveness of the heuristics.
暂无评论