Sciweavers

162 search results - page 3 / 33
» Optimizations of data structures, heuristics and algorithms ...
Sort
View
ICML
2005
IEEE
14 years 6 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
VLDB
1997
ACM
142views Database» more  VLDB 1997»
13 years 10 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 6 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
DMIN
2008
190views Data Mining» more  DMIN 2008»
13 years 7 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 7 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...