Sciweavers

553 search results - page 6 / 111
» Perfect difference sets constructed from Sidon sets
Sort
View
IMCSIT
2010
13 years 6 months ago
Learning taxonomic relations from a set of text documents
This paper presents a methodology for learning taxonomic relations from a set of documents that each explain one of the concepts. Three different feature extraction approaches with...
Mari-Sanna Paukkeri, Alberto Pérez Garc&iac...
TCBB
2008
101views more  TCBB 2008»
13 years 8 months ago
The Undirected Incomplete Perfect Phylogeny Problem
The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or g...
Ravi Vijaya Satya, Amar Mukherjee
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
WWW
2005
ACM
14 years 9 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan