Sciweavers

17688 search results - page 146 / 3538
» Data Set Balancing
Sort
View
150
Voted
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 8 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
168
Voted
BMCBI
2006
147views more  BMCBI 2006»
15 years 4 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
Alex Lewin, Ian C. Grieve
GIS
2004
ACM
16 years 5 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
WSCG
2003
145views more  WSCG 2003»
15 years 5 months ago
Analysis of Four-Dimensional Cardiac Data Sets Using Skeleton-Based Segmentation
Computer-aided analysis of four-dimensional tomography data has become an important tool in modern cardiology. In order to examine the capability and health of a patient’s cardi...
André Neubauer, Rainer Wegenkittl
CVPR
1996
IEEE
16 years 6 months ago
Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
Xiaoguang Wang, Yong-Qing Cheng, Robert T. Collins...