Sciweavers

829 search results - page 108 / 166
» A new watermarking approach for relational data
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
14 years 7 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
CHI
2002
ACM
15 years 10 months ago
NetRaker suite: a demonstration
This demonstration will show the application of a unique approach to collecting and analyzing usability data from the users of Web sites and software applications. The NetRaker Su...
Doug van Duyne, James A. Landay, Matthew Tarpy
ICML
2005
IEEE
15 years 10 months ago
Reducing overfitting in process model induction
In this paper, we review the paradigm of inductive process modeling, which uses background knowledge about possible component processes to construct quantitative models of dynamic...
Will Bridewell, Narges Bani Asadi, Pat Langley, Lj...
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 2 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
NIPS
2004
14 years 11 months ago
Maximum Margin Clustering
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...