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.
Concept lattice is widely used in data analysis. This paper aims to reduce redundant nodes from concept lattice by replacing lattice with join-semilattice. We develop an algorithm based on gradual insertion of concepts into partially hasse diagram. An example is proposed to illustrate the constructing procedure of concept semilattice. Experimental results show effectiveness and efficiency of the proposed...
Concept lattice is an efficient formal tool for data analysis and knowledge extraction. For solving the redundancy of nodes and edges in concept lattice, we replace lattice with join-semilattice and present an incremental algorithm based on increasing attributes during the construction process. We provide the implementation of this algorithm and demonstrate the process of concept semilattice updating...
For solving the redundancy of nodes and edges in concept lattice, we replace lattice with join-semilattice and present an algorithm which relies upon a strategy of gradual insertion of the concepts into the partially built hasse diagram. A threshold value is introduced to limit the number of concept nodes. We present the implementation of this algorithm and demonstrate the process of concept semilattice...
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local...
Decision trees represent a simple and powerful method of induction from labeled instances. Fuzzy decision tree is the generalization of decision tree in fuzzy environment. The knowledge represented by fuzzy decision tree is more natural to the way of human thinking, but it's preprocess and tree-constructing are much costly. In this paper, we propose a modified fuzzy decision tree model (MFD). Entropy...
The quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems known. Ant algorithms have been inspired by the behavior of real ant colonies. In this paper, we introduce random algorithm to the constructive procedure of the solution of ant system (AS) and adopt dynamic adaptive approach to update pheromone trails. In our algorithm, only partial facilities are randomly...
Ant algorithms are a recently developed, population- based approach which has been successfully applied to several NP-hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS),we present an ant colony system hybridized with randomized algorithm(RAACS). In RAACS, only partial cities are randomly chosen to...
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.