Sciweavers

4095 search results - page 449 / 819
» How to test a tree
Sort
View
IJCAI
2007
15 years 7 months ago
Dynamically Weighted Hidden Markov Model for Spam Deobfuscation
Spam deobfuscation is a processing to detect obfuscated words appeared in spam emails and to convert them back to the original words for correct recognition. Lexicon tree hidden M...
Seunghak Lee, Iryoung Jeong, Seungjin Choi
LWA
2007
15 years 7 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
APBC
2004
132views Bioinformatics» more  APBC 2004»
15 years 7 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
CLIN
2003
15 years 7 months ago
On the Statistical Consistency of DOP Estimators
A statistical estimator attempts to guess an unknown probability distribution by analyzing a sample from this distribution. One desirable property of an estimator is that its gues...
Detlef Prescher, Remko Scha, Khalil Sima'an, Andre...
KDID
2003
93views Database» more  KDID 2003»
15 years 7 months ago
A Framework for Frequent Sequence Mining under Generalized Regular Expression Constraints
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
Hunor Albert-Lorincz, Jean-François Boulica...