Sciweavers

4085 search results - page 589 / 817
» Benchmarking Data Mining Algorithms
Sort
View
FLAIRS
2010
15 years 9 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 5 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
ICPR
2008
IEEE
16 years 1 months ago
Registration by using a pseudo color attribute
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
Felipe Trujillo-Romero, Michel Devy
AIMSA
2008
Springer
16 years 1 months ago
Prototypes Based Relational Learning
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
Rocío García-Durán, Fernando ...
ACAL
2007
Springer
16 years 1 months ago
An Integrated QAP-Based Approach to Visualize Patterns of Gene Expression Similarity
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
Mario Inostroza-Ponta, Alexandre Mendes, Regina Be...