Data Mining & Data Ware House
Data Mining & Data Ware House
31. Decision trees is
- A family of relational database management systems marketed by IBM
- Interactive systems that enable decision makers to use database and models on a computer in order to solve ill-structured problems
- It consists of nodes and branches starting from a single rot node. Each node represents a test, or decision.
- None of these
32. Deep knowledge referred to
- It is hidden within a database and can only be recovered if one is given certain clues be recovered if one is given certain clues (an example IS encrypted information)
- the process of executing implicit previously unknown and potentially useful information from dat(A)
- An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
- None of these
33. Discovery is
- It is hidden within a diatabase and can only be recovered if one is given certain clues (an example if one is given certain clues (an example IS encrypted information).
- The process of executing implicit previously unknown and potentially useful information from dat(A)
- An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
- None of these
34. DNA (Dexoyribonucleic acid)
- It is hidden within a database and can only be recoverd if one is given certain clues (an example IS encrypted information).
- The process of executing implicit previously unknown and potentially useful information from dat (A)
- An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
- None of these
35. Enrichment is
- A stage of the KDD process in which new data is added to the existing selection
- The processo of finding solution for a pssible solutions according to some pre-defined order and then testing them.
- The distance between two points as calculated using the Pythagoras theorem.
- None of these
36. Enumeration is referred to
- A stage of the KDD process in which new data is added to the existing selection
- The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
- The distance between two points as calculated using the Pythagoras theorem.
- None of these
37. Euclidean distance measure is
- A stage of the KDD process in which new data is added to the existing selection
- The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them.
- The distance between two points as calculated using the Pythagoras theorem
- None of these
38. Heuristic is
- A set of databases from different vendors, possibly using different database paradigms
- An approach toa a problem that is not guaranteed to work but performs well in most cases
- Information that is hidden in a database and that cannot be recovered by a simply SQL query.
- None of these
39. Heterogeneous databases referred to
- A set of database from different vendors, possibly using different database paradigms
- An approach to a problem that is not guaranteed to work but performs well in most cases
- Information that is hidden in a database and that cannot be recovered by a simply SQL query
- None of these
40. Hidden knowledge referred to
- A set of database from different vendors, possibly using different database paradigms
- An approach to a problem that is not guaranteed to work but performs well in most cases
- Information that is hidden in a database and that cannot be recovered by a simple SQL query
- None of these