Sciweavers

1314 search results - page 156 / 263
» Approximate data mining in very large relational data
Sort
View
IWANN
2009
Springer
15 years 8 months ago
Identifying Gene Ontology Areas for Automated Enrichment
Biomedical ontologies provide a commonly accepted scheme for the characterization of biological concepts that enable knowledge sharing and integration. Updating and maintaining an ...
Catia Pesquita, Tiago Grego, Francisco M. Couto
VISUALIZATION
1997
IEEE
15 years 6 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
15 years 3 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
IS
2007
15 years 1 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
GIS
2007
ACM
16 years 3 months ago
Environmental scenario search and visualization
We have developed Environmental Scenario Search Engine (ESSE) for parallel data mining of a set of conditions inside distributed, very large databases from multiple environmental ...
Mikhail N. Zhizhin, Eric A. Kihn, Vassily Lyutsare...