Sciweavers

8294 search results - page 25 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 10 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
BMCBI
2006
153views more  BMCBI 2006»
13 years 10 months ago
Intensity-based hierarchical Bayes method improves testing for differentially expressed genes in microarray experiments
Background: The small sample sizes often used for microarray experiments result in poor estimates of variance if each gene is considered independently. Yet accurately estimating v...
Maureen A. Sartor, Craig R. Tomlinson, Scott C. We...
ICDAR
1999
IEEE
14 years 2 months ago
Models and Algorithms for Duplicate Document Detection
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
Daniel P. Lopresti
ACL
2006
13 years 11 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
IS
2008
13 years 9 months ago
Mining relational data from text: From strictly supervised to weakly supervised learning
This paper approaches the relation classification problem in information extraction framework with different machine learning strategies, from strictly supervised to weakly superv...
Zhu Zhang