Sciweavers

301 search results - page 35 / 61
» The k-Median Problem for Directed Trees
Sort
View
APPINF
2003
13 years 9 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
WEBDB
2005
Springer
151views Database» more  WEBDB 2005»
14 years 1 months ago
Constructing Maintainable Semantic Mappings in XQuery
Semantic mapping is one of the important components underlying the data sharing systems. As is known, constructing and maintaining such mappings both are necessary yet extremely h...
Gang Qian, Yisheng Dong
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 11 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
INFORMS
2010
177views more  INFORMS 2010»
13 years 6 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...