Sciweavers

245 search results - page 49 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 4 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
ICCV
2003
IEEE
14 years 6 months ago
Ranking Prior Likelihood Distributions for Bayesian Shape Localization Framework
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...
Shuicheng Yan, Mingjing Li, HongJiang Zhang, QianS...
BMCBI
2007
133views more  BMCBI 2007»
13 years 4 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
CAD
2005
Springer
13 years 4 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
EOR
2007
165views more  EOR 2007»
13 years 4 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang