Proceedings of the Thirty-First Hawaii International Conference on System Sciences
DOI: 10.1109/hicss.1998.648320
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting parallelism in knowledge discovery systems to improve scalability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…To achieve this goal, all instances of the best substructure at a given level are compressed to a single vertex and SUBDUE is invoked on the "reduced graph". Hierarchy of substructures obtained in this way is then used for various levels of interpretation; depending on goals of data analysis (see [1,6,8] for a complete description of SUBDUE and examples of its application to real-life problems).…”
Section: Subduementioning
confidence: 99%
See 1 more Smart Citation
“…To achieve this goal, all instances of the best substructure at a given level are compressed to a single vertex and SUBDUE is invoked on the "reduced graph". Hierarchy of substructures obtained in this way is then used for various levels of interpretation; depending on goals of data analysis (see [1,6,8] for a complete description of SUBDUE and examples of its application to real-life problems).…”
Section: Subduementioning
confidence: 99%
“…The need to extract valuable information from this data challenges researchers to develop efficient techniques to discover and interpret interesting patterns in it. In this paper we are interested in discovering concepts in structural data, for which a number of algorithms have been proposed [1,6,8]. One of them, SUBDUE, discovers substructures on the basis of the minimum description length principle [8].…”
Section: Introductionmentioning
confidence: 99%