Sciweavers

2712 search results - page 43 / 543
» Sequence Comparison Using a Relational Database Approach
Sort
View
ICTAI
2006
IEEE
14 years 1 months ago
Sequence Mining Without Sequences: A New Way for Privacy Preserving
During the last decade, sequential pattern mining has been the core of numerous researches. It is now possible to efficiently discover users’ behavior in various domains such a...
Stéphanie Jacquemont, François Jacqu...
SEMWEB
2007
Springer
14 years 1 months ago
Discovering Simple Mappings Between Relational Database Schemas and Ontologies
Ontologies proliferate with the growth of the Semantic Web. However, most of data on the Web are still stored in relational databases. Therefore, it is important to establish inter...
Wei Hu, Yuzhong Qu
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 7 months ago
XANADUE: a system for detecting changes to XML data in tree-unaware relational databases
Recently, a number of main memory algorithms for detecting the changes to XML data have been proposed. These approaches are not suitable for detecting changes to large XML documen...
Erwin Leonardi, Sourav S. Bhowmick
ECML
2005
Springer
14 years 1 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
13 years 7 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...