17688 search results - page 127 / 3538 » Data Set Balancing |
179
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
215
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
121
click to vote
ECSQARU
2005
Springer
15 years 10 months ago
2005
Springer
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
144
click to vote
TSDM
2000
15 years 8 months ago
2000
In this paper I define spatio-temporal regions as pairs consisting of a spatial and a temporal component and I define topological relations between them. Using the notion of rough ...
124
click to vote
ISCI
1998
15 years 4 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...