Sciweavers

1083 search results - page 3 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
13 years 8 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
IJIT
2004
13 years 6 months ago
IMDC: An Image-Mapped Data Clustering Technique for Large Datasets
In this paper, we present a new algorithm for clustering data in large datasets using image processing approaches. First the dataset is mapped into a binary image plane. The synthe...
Faruq A. Al-Omari, Nabeel I. Al-Fayoumi
ESCIENCE
2007
IEEE
13 years 8 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
FQAS
2004
Springer
146views Database» more  FQAS 2004»
13 years 8 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
CGF
2002
142views more  CGF 2002»
13 years 4 months ago
Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces
We present a method to efficiently construct and render a smooth surface for approximation of large functional scattered data. Using a subdivision surface framework and techniques...
Vincent Scheib, Jörg Haber, Ming C. Lin, Hans...