The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Today's applications deal with multiple types of information: graph data to represent the relations between objects and attribute data to characterize single objects. Analyzing both data sources simultaneously can increase the quality of mining methods. Recently, combined clustering approaches were introduced, which detect densely connected node sets within one large graph that also show high similarity...
In open environments, deciding if an individual is trustworthy, based on his past behavior, is fundamentally important. To accomplish this, centrality in a so-called feedback graph is often used as a trust measure. The nodes of this graph represent the individuals, and an edge represents feedback that evaluates a past interaction. In the open environments envisioned where individuals can specify for...
The previous study of pattern discovery in storage systems focus on sequential pattern (SP) mining in lower level traces, but they don't scale well to the application level. For patterns in application level are mostly composed of Contiguous Item Sequential Patterns (CISP) which are much simpler than SP, so it's inefficient for the previous studies to mine CISP with clumsy SP mining algorithms. We...
Existing studies on graph mining focus on exact graphs that are precise and complete. However, graph data tends to be uncertain in practice due to noise, incompleteness and inaccuracy. This paper investigates the problem of finding top-k maximal cliques in an uncertain graph. A new model of uncertain graphs is presented, and an intuitive measure is introduced to evaluate the significance of vertex...
Outlier detection plays an important role in data mining as outliers may contain some useful information in many applications. In this paper we propose a method of graph-cut based outlier detection using ant colony optimization algorithm. Both the correlation and the discreteness of the attributes are used to weight the data's characteristics. We use the ant colony optimization algorithm to find optimal...
This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete, sensing graph. In this method each agent acts to minimize a local alignment error function that measures the difference between the desired relative formation of the agent and its neighbors (as determined by a sensing graph) and their current positions. It is shown that...
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a motif-driven approach where the support of candidate motif pairs is evaluated in the network. We experimentally...
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct temporal causal graphical models. However, how to best understand and conceptualize these complicated causal relationships is still an open problem. In this paper, we propose a decomposition approach to simplify the temporal...
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. This binary graph structure is obtained by reformulating the inference problem as a generalization of the polynomial time combinatorial optimization known as b-matching. Standard b-matching recovers a constant-degree constrained...
Efficient task scheduling, as a crucial step to achieve high performance for multiprocessor platform, remains one of the challenge problems despite of numerous studies. This paper presents a novel scheduling algorithm based on Bayesian optimization algorithm (BOA) for heterogeneous computing environment. In the proposed algorithm, BOA constructs and updates Bayesian network according to the task graph...
In this paper, we consider optimization and identification problems in a non-equilibrium dynamic game. To be precise, we consider infinitely repeated games between a human and a machine based on the standard prisoners' dilemma model. The machine's strategy is assumed to be fixed with k-step memory, which may be unknown to the human. By analyzing the state transfer graph, it will be shown that the...
It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are...
This paper presents a performance study of two versions of a unidimensional search algorithm aimed at solving high-dimensional optimization problems. The algorithms were tested on 11 scalable benchmark problems. The aim is to observe how metaheuristics for continuous optimization problems respond with increasing dimension. To this end, we report the algorithms' performance on the 50, 100, 200 and...
This paper illustrated the characteristics of UTP-5 and Hub-spoken topology, and presented the concept of margin motion coefficient and reliability coefficient based on graph theory and relation matrix and made thorough analysis and comparison. Suggestions are made on resolution of topology problems on cabling infrastructure of intelligent buildings.
The data structure diagram is abstracted from the diagram of railway yard signal arrangement. HBACA (hybrid behavior based ant colony algorithm) is presented to search the shortest route of railway yard. The route searching program based on HBACA is developed. The graphical representation of railway yard is given on the console. According to the designated beginning node and the designated ending...
An abstraction of a problem of rearranging group of mobile robots is addressed in this paper (the problem of multi-robot path planning). The robots are moving in an environment in which they must avoid obstacles and each other. An abstraction where the environment is modeled as an undirected graph is adopted throughout this work. A case when the graph modeling the environment is biconnected is particularly...
Given an undirected graph with weights on the vertices, the maximum weight clique problem requires to find the clique of the graph which has the maximum weight. The problem is a general form of the maximum clique problem. In this paper, we encoded weight of vertex into a unique fixed length oligonucleotide segment and employed sticker model to solve the problem. The proposed method has two distinct...
In order to enhance the hull erection efficiency and realize the supervisory control dynamically to construction course, this paper applies Fuzzy-timed place Petri net to simulate the process of hull erection. Triangular Fuzzy Number is utilized to denote the uncertain duration, and an advanced Minkowski subtraction is presented in the model. We eliminate the Hatch Coaming Sections, combine the Compartment...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.