Sciweavers

1700 search results - page 210 / 340
» Combinatorial Pattern Matching
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 5 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
CPAIOR
2007
Springer
14 years 5 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
ACSC
2005
IEEE
14 years 4 months ago
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
Pablo Moscato, Luke Mathieson, Alexandre Mendes, R...
GBRPR
2005
Springer
14 years 4 months ago
Pyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Carine Grasset-Simon, Guillaume Damiand, Pascal Li...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 4 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian