[LIBRO][B] Data mining with decision trees: theory and applications
Decision trees have become one of the most powerful and popular approaches in
knowledge discovery and data mining; it is the science of exploring large and complex …
knowledge discovery and data mining; it is the science of exploring large and complex …
[LIBRO][B] Pattern classification using ensemble methods
L Rokach - 2010 - books.google.com
1. Introduction to pattern classification. 1.1. Pattern classification. 1.2. Induction algorithms.
1.3. Rule induction. 1.4. Decision trees. 1.5. Bayesian methods. 1.6. Other induction …
1.3. Rule induction. 1.4. Decision trees. 1.5. Bayesian methods. 1.6. Other induction …
[LIBRO][B] Ensemble learning: pattern classification using ensemble methods
L Rokach - 2019 - World Scientific
Artificial intelligence (AI) is a scientific discipline that aims to create intelligent machines.
Machine learning is a popular and practical AI subfield that aims to automatically improve …
Machine learning is a popular and practical AI subfield that aims to automatically improve …
[LIBRO][B] Decomposition methodology for knowledge discovery and data mining
The idea of decomposition methodology is to break down a complex Data Mining task into
several smaller, less complex and more manageable, sub-tasks that are solvable by using …
several smaller, less complex and more manageable, sub-tasks that are solvable by using …
Combinational logic synthesis for LUT based field programmable gate arrays
J Cong, Y Ding - ACM Transactions on Design Automation of Electronic …, 1996 - dl.acm.org
The increasing popularity of the field programmable gate-array (FPGA) technology has
generated a great deal of interest in the algorithmic study and tool development for FPGA …
generated a great deal of interest in the algorithmic study and tool development for FPGA …
Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems
Abstract The Graph Coloring Problem (GCP) can be simply defined as partitioning the
vertices of a graph into independent sets while minimizing the number of colors used. So far …
vertices of a graph into independent sets while minimizing the number of colors used. So far …
[PDF][PDF] Decomposition of boolean functions specified by cubes
JA Brzozowski, T Luba - Journal of Multiple Valued Logic and Soft …, 2003 - researchgate.net
We study the problem of decomposing a Boolean function into a set of functions with fewer
arguments. This problem has considerable practical importance in VLSI. For example, for …
arguments. This problem has considerable practical importance in VLSI. For example, for …
Area–oriented technology map** for LUT–based logic blocks
M Kubica, D Kania - International Journal of Applied Mathematics and …, 2017 - sciendo.com
One of the main aspects of logic synthesis dedicated to FPGA is the problem of technology
map**, which is directly associated with the logic decomposition technique. This paper …
map**, which is directly associated with the logic decomposition technique. This paper …
FPGA design by generalized functional decomposition
T Sasao - Logic synthesis and optimization, 1993 - Springer
ABSTRACT A method for designing look-up table type Field Programmable Gate Arrays
(FPGAs) by functional decomposition is presented. Look-up table type FPGAs consist of 5 …
(FPGAs) by functional decomposition is presented. Look-up table type FPGAs consist of 5 …
Learning by discovering concept hierarchies
We present a new machine learning method that, given a set of training examples, induces a
definition of the target concept in terms of a hierarchy of intermediate concepts and their …
definition of the target concept in terms of a hierarchy of intermediate concepts and their …