Sciweavers

155 search results - page 4 / 31
» A parallel, distributed algorithm for relational frequent pa...
Sort
View
SPAA
1997
ACM
13 years 11 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
FQAS
2004
Springer
146views Database» more  FQAS 2004»
13 years 11 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
ISCI
2008
116views more  ISCI 2008»
13 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
NEUROSCIENCE
2001
Springer
13 years 12 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
SKG
2006
IEEE
14 years 1 months ago
A Grid Service for Pattern Extraction from Mass Spectrometry Data
The paper presents a Grid Service allowing to detect and extract the longest common sub-spectrum among a set of mass spectrometry spectra data. The service is based on a novel pat...
Mario Cannataro, Pierangelo Veltri