Sciweavers

68 search results - page 7 / 14
» Learning extended tree augmented naive structures
Sort
View
SDMW
2004
Springer
14 years 3 months ago
Secure and Privacy Preserving Outsourcing of Tree Structured Data
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
Ping Lin, K. Selçuk Candan
ISMB
1993
13 years 11 months ago
Protein Structure Prediction: Selecting Salient Features from Large Candidate Pools
Weintroduce a parallel approach, "DT-SELECT," for selecting features used by inductive learning algorithms to predict protein secondary structure. DT-SELECTis able to ra...
Kevin J. Cherkauer, Jude W. Shavlik
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 10 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICML
2006
IEEE
14 years 10 months ago
Kernelizing the output of tree-based methods
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...