Efficient probability density balancing for supporting distributed knowledge discovery in large databases

2003 ◽  
Author(s):  
D. Obradovic ◽  
Z. Obradovic
Keyword(s):  
Knowledge Discovery ◽  
Probability Density ◽  
Distributed Knowledge ◽  
Large Databases

Discovering Frequent Embedded Subtree Patterns from Large Databases of Unordered Labeled Trees

2008 ◽  
pp. 3235-3251
Author(s):  
Yongqiao Xiao ◽  
Jenq-Foung Yao ◽  
Guizhen Yang
Keyword(s):  
Knowledge Discovery ◽  
Web Sites ◽  
Synthetic Data ◽  
Research Interest ◽  
Data Sets ◽  
Labeled Trees ◽  
Computational Overhead ◽  
Large Databases ◽  
Frequency Counts ◽  
Novel Algorithm

Recent years have witnessed a surge of research interest in knowledge discovery from data domains with complex structures, such as trees and graphs. In this paper, we address the problem of mining maximal frequent embedded subtrees which is motivated by such important applications as mining “hot” spots of Web sites from Web usage logs and discovering significant “deep” structures from tree-like bioinformatic data. One major challenge arises due to the fact that embedded subtrees are no longer ordinary subtrees, but preserve only part of the ancestor-descendant relationships in the original trees. To solve the embedded subtree mining problem, in this article we propose a novel algorithm, called TreeGrow, which is optimized in two important respects. First, it obtains frequency counts of root-to-leaf paths through efficient compression of trees, thereby being able to quickly grow an embedded subtree pattern path by path instead of node by node. Second, candidate subtree generation is highly localized so as to avoid unnecessary computational overhead. Experimental results on benchmark synthetic data sets have shown that our algorithm can outperform unoptimized methods by up to 20 times.

Using Grids for Distributed Knowledge Discovery

2011 ◽  
pp. 284-298 ◽  
Author(s):  
Antonio Congiusta ◽  
Domenico Talia ◽  
Paolo Trunfio
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
High Performance ◽  
Data Transfer ◽  
Grid Services ◽  
Distributed Knowledge ◽  
Data Intensive ◽  
Knowledge Grid ◽  
Complex Knowledge ◽  
High Level

Knowledge discovery is a compute and data intensive process that allows for finding patterns, trends, and models in large datasets. The Grid can be effectively exploited for deploying knowledge discovery applications because of the high-performance it can offer and its distributed infrastructure. For effective use of Grids in knowledge discovery, the development of middleware is critical to support data management, data transfer, data mining and knowledge representation. To such purpose, we designed the Knowledge Grid, a high-level environment providing for Grid-based knowledge discovery tools and services. Such services allow users to create and manage complex knowledge discovery applications, composed as workflows that integrate data sources and data mining tools provided as distributed Grid services. This chapter describes the Knowledge Grid architecture and describes how its components can be used to design and implement distributed knowledge discovery applications. Then, the chapter describes how the Knowledge Grid services can be made accessible using the Open Grid Services Architecture (OGSA) model.

Knowledge discovery in databases: Progress report

1994 ◽  
Vol 9 (1) ◽  
pp. 57-60 ◽  
Author(s):  
Gregory Piatetsky-Shapiro
Keyword(s):  
Knowledge Discovery ◽  
Progress Report ◽  
Knowledge Discovery In Databases ◽  
Classification Rules ◽  
Data Summarization ◽  
Dependency Networks ◽  
Large Databases ◽  
Very Large Databases ◽  
Intelligent Databases ◽  
Clustering Data

As the number and size of very large databases continues to grow rapidly, so does the need to make sense of them. This need is addressed by the field called knowledge Discovery in Databases (KDD), which combines approaches from machine learning, statistics, intelligent databases, and knowledge acquisition. KDD encompasses a number of different discovery methods, such as clustering, data summarization, learning classification rules, finding dependency networks, analysing changes, and detecting anomalies (Matheus et at., 1993).

A grid portal for solving geoscience problems using distributed knowledge discovery services

2010 ◽  
Vol 26 (1) ◽  
pp. 87-96 ◽  
Author(s):  
Gianluigi Folino ◽  
Agostino Forestiero ◽  
Giuseppe Papuzzo ◽  
Giandomenico Spezzano
Keyword(s):  
Knowledge Discovery ◽  
Distributed Knowledge ◽  
Grid Portal
Sign in / Sign up

Export Citation Format

Share Document