PC Training Institute

Question -Bank
MC0088 Data Mining (SMU)
1- MARKS QUSTI!"S
QS 1. DATA ------------- IS CONCERNED WITH FINDING HIDDEN RELATIONSHIP PRESENT
IN BUSINESS DATA TO ALLOW BUSINESS TO MAKE PREDICTIONS FOR FUTURE USE.
1. WAREHOUSING
#$ MI"I"%
3. EXTRACTION
4. HIDING
QS 2. WHOLE LOGIG OF DATA MINING IS BASED ON MODELING.
1$ TRU
2. FALSE
QS 3. DATA IN DATA PROCESSING IS IN DIFFERENT FORMATS -----------
1. OPERATIONAL / TRANSACTIONAL DATA
2. NON-OPERATIONAL DATA
3. INFORMATION AND KNOWLEDGE
&$ A'' !( T) AB!*
QS 4. DATA WAREHOUSING IS DEFINED AS A PROCESS OF CENTRALIZED DATA
MANAGEMENT AND RETRIEAL.
1$ TRU
2. FALSE
QS !. KDD STANDS FOR -----------
1$ K"!+'D% DISC!*R, I" DATABASS
2. KNOWN DISCOERED DATABASES
3. BOTH OF THE ABOE
4. NONE OF THE ABOE
QS ". ------------------ IS A TECHNOLOG# THAT IS USED TO CREATE DECISION SUPPORT
SOFTWARE. OLAP AND DATA MINING ARE USED TO SOLE DIFFERENT KINDS OF
ANAL#TIC PROBLEMS.
1. !'AP $ONLINE ANAL#TICAL PROCESSING %
2. OLTP$ONLINE TRANSACTION PROCESSING %
3. KDD
4. DATA MINING
QS &. BANKING' INSURANCE' CREDIT MARKETING' TELECOMMUNICATIONS'
PHARMACEUTICALS AND BIOINFORMATICS ARE THE DIFFERENT APPLICATIONS IN THE
INDUSTR# IN WHICH DATA MINING IS USED
1$ C!RRCT
2. INCORRECT
QS (. ----------- PROIDES SOFTWARE CALLED DARWIN' WHICH IS DATA MINING TOOL.
IT INCORPORATES CLUSTER ANAL#SIS' CLASSIFICATION' AND PREDICTION AND
ASSOCIATION RULES
1. INTELLIGENT MINER $IBM CORP%
2. WEAK 3-A
-$ !RAC' 10 %
4. ENTERPRISE MINER $SAS INSTITUTE INC.%
QS ). THE CONSTRUCTION OF DATA WAREHOUSE' WHICH INOLES -------------CAN BE
IEWED AS AN IMPORTANT PREPROCESSING STEP FOR DATA MINING
1. DATA CLEANING
2. DATA INTEGRATION'
3. DATA HIDING
&$ B!T) 1 A"D #
QS 1*. DATA WAREHOUSING PROIDES AN INTERESTING ALTERNATIE TO THE
TRADITIONAL APPROACH OF ------------- DATABASES INTEGRATION.
1. HOMOGENEOUS
#$ )TR!%"!US
3. ALL OF THE ABOE
4. NONE OF THE ABOE
QS 11. -------------------- APPROACH REQUIRES COMPLEX INFORMATION FILTERING AND
INTEGRATION PROCESSES' AND COMPETES FOR RESOURCES WITH PROCESSING AT
LOCAL SOURCES.
1. WRAPPERS
2. INTEGRATORS
3. UPDATE DRIEN
&$ QUR, DRI*"
QS 12. DATA WAREHOUSE AND OLAP TOOLS ARE NOT BASED ON A
MULTIDIMENSIONAL DATA MODEL.
1. TRUE
#$ (A'S
QS 13 ---------- WHICH CONTAINS LANGUAGE PRIMITIES FOR DEFINING DATA
WAREHOUSES AND DATA MARTS. LANGUAGE PRIMITIES FOR SPECIF#ING OTHER DATA
MINING TASKS SUCH AS MINING OF CONCEPT' CLASS DESCRIPTIONS' ASSOCIATIONS'
CLASSIFICATIONS AND SO ON.
1. SQL
#$ DMQ'
3. DATABASE LANGUAGE
4. ALL OF THE ABOE
QS 14. TOP DOWN IEW' DATA SOURCE IEW ' DATA WAREHOUSE IEW AND BUSINESS
QUER# IEW ARE THE IEWS CONSIDERED DURING THE -------- PHASE OF A DATA
WAREHOUSE
1. ANAL#SIS
2. TESTING
-$ DSI%"
4. CONSTRUCTION
QS 1!. A --------- CONTAINS A SUBSET OF CORPORATE WIDE DATA THAT IS OF ALUE
TO A SPECIFIC GROUP OF USERS
1$ DATA MART
2. DATA WAREHOUSE
3. DATA MINING
4. ALL OF THE ABOE
QS 1". A IRTUAL WAREHOUSE IS A SET OF IEWS OER OPERATIONAL DATABASES
1$ TRU
2. FALSE
QS 1&. AGGREGATED DATA CAN BE STORED IN FACT TABLES REFERRED TO AS
-----------
1. FACT TABLE
2. DIMENSION TABLE
-$ SUMMAR, (ACT TAB'
4. SUMMAR# TABLE
QS 1(. MULTIDIMENSIONAL ANAL#SIS SOFTWARE ALSO KNOWN AS --------
1$ !'AP
2. OLTP
3. KDD
4. MOLAP
QS 1). ---------- IS INFORMATION ABOUT A COMPAN#+S PAST PERFORMANCE THAT IS
USED TO HELP PREDICT THE COMPAN#+S FUTURE PERFORMANCE.
1. ARTIFICIAL INTELLIGENCE $AI%
#$ BUSI"SS I"T''I%"C (BI)
3. LOGICAL INTELLIGENCE
4. NONE OF THE ABOE
QS 2*. TODA#+S REAL WORLD DATABASES ARE HIGHL# SUSCEPTIBLE TO --------
DUE TO THEIR T#PICALL# HUGE SIZE' OFTEN SEERAL GIGAB#TES OR MORE
1. NOIS#
2. INCONSISTENT DATA
3. MISSING
&$ A'' !( T) AB!*
QS 21. BUCKETS OR BINS ARE NOT INTERCHANGEABLE TERMS
1. CORRECT
#$ I"C!RRCT
QS 22. BINNING' CLUSTERING AND REGRESSION TECHNIQUES WORKS TO REMOE THE
NOISE FROM THE DATA DURING TRANSFORMATION OF DATA IN -----------
1. NORMALIZATION
#$ SM!!T)I"%
3. AGGREGATION
4. GENERALIZATION
QS 23. ---------- TECHNIQUES CAN BE APPLIED TO OBTAIN A REDUCED
REPRESENTATION OF THE DATA SET THAT IS MUCH SMALLER IN OLUME #ET CLOSEL#
CONTAINS THE INTEGRIT# OF THE ORIGINAL DATA.
1. NORMALIZATION
#$ DATA RDUCTI!"
3. SMOOTHING
4. AGGREGATION
QS 24. SAMPLING CAN BE USED AS DATA ---------- TECHNIQUE.
1. NORMALIZATION
2. CREATION
-$ RDUCTI!"
4. MINING
QS 2!. A MA,ORIT# OF DATA MINING S#STEMS DO NOT USE AN# DBMS AND HAE
THEIR OWN MEMOR# AND STORAGE MANAGEMENT.
1$ TRU
2. FALSE
QS 2". ASSOCIATION' CLASSIFICATION' REGRESSION' CLUSTERING AND NEURAL
NETWORKS ALL ARE DATA ---------- TECHNIQUES
1. NORMALIZATION
2. CREATION
3. REDUCTION
&$ MI"I"%
QS 2&. MCFS STANDS FOR
A$ MA.IMUM (RQU"T CA"DIDAT ST
B. MINIMAL FREQUENT CANDIDATE SET
C. NONE OF ABOE
D. ALL OF THE ABOE
QS 2(. MD'$
1. MAXIMUM DESCRIPTION LENGTH
2. MI"IMUM DSCRIPTI!" '"%T)
3. MEAN DESCRIBED LENGTH
4. MINIMUM DESCRIBED LENGTH
QS 2). POST PRUNING APPROACH REMOES BRANCHES FROM A -FULL# GROWN+ TREE.
1. TRU
2. FALSE
QS 3*. Q( CLASSIFICATION AND PREDICTION ARE TWO FORMS OF
1. DATA A"A',SIS
2. DECISION TREE
3. A AND B
4. NONE OF THESE
QS 31. DECISION TREE IS BASED ON
1. BOTTOM-DOWN TECHNIQUE
B. TOP-DOWN TECHIQUE
C. DIIDE-AND-CONQUER MANNER
D. T!P-D!+" RCURSI* DI*ID-A"D-C!"QUR MA""R
QS -#$ PAM STANDS FOR
A. PROTOT#PE ABOE MEDOIDS
B PROTOT#PE AROUND MEANS
C$ PARITI!"I"% AR!U"D MD!IDS
D. PARITIONING ABOE MEANS
QS 33. A USER SESSION IS A--------- RECORD SPANNING THE ENTIRE WEB
QS 34 WEB DATA IS ----------
1. STRUCTURED DATA
#$ U"STRUCTURD DATA
3. TEXT DATA BINAR# DATA
4. BINAR# DATA
QS 3!. USER NAIGATION ACCESSING TECHNIQUE IS -------
1. WEB STRUCTURED MINING
#$ +B USA% MI"I"%
3. WEB CONTENT MINING
4. WEB DATA DEFINITION MINING
QS 3". E-BANKING' SEARCH ENGINE' ONLINE AUCTION AND WEB ADERTISMENT ARE
THE FEW APPLICATIONS OF -----------------
1.WEB STRUCTURED MINING
#$ +B USA% MI"I"%
3.WEB CONTENT MINING
4.WEB DATA DEFINITION MINING
QS 3&. BO $BOOKMARK ORGANIZER % COMBINES HIERARCHICAL CLUSTERING
TECHNIQUES AND USER INTERACTION TO ORGANIZE A COLLECTION OF WEB
DOCUMENTS BASED ON CONCEPTUAL INFORMATION.
1$ TRU
2. FALSE
QS 3(. E-COMMERCE SITE WILL BE DEFINED AS AN# WEB SITE OFFERING ------
1. PRE-SALE SUPPORT
2. PRODUCTS FOR SALE
3. AFTER SALES SERICE AND BACKUP
&$ A'' !( T) AB!*
QS 3). --------- IS A LINK ANAL#SIS ALGORITHUM THAT ASSIGNS A NUMERICAL
WEIGHING TO EACH ELEMENT OF A H#PERLINKED SET OF DOCUMENTS SUCH AS THE
WORLD WIDE WEB.
1. WEB AGENT
2. LOG FILE
-$ PA% RA"K
4. USER PROFILE
QS 4*. ---------- IS SIMPLE TEXT FILE THAT ARE AUTOMATICALL# GENERATED EER#
TIME SOMEONE ACCESSES ONE WEBSITE.
1. WEB AGENT
#$ '!% (I'
3. PAGE RANK
4. USER PROFILE
#- MARKS QUSTI!"S
QS 1. ----------- MA# BE DETECTED B# CLUSTERING' WHERE SIMILAR ALUES ARE
ORGANIZED INTO GROUPS OR .CLUSTERS/. INTUITIEL#' ALUES THAT FALL OUTSIDE
OF THE SET OF CLUSTERS MA# BE CONSIDERED -----------.
1. CLUSTERS' BINS
2. GROUPS' BUCKETS0
-$ !UT'IRS/ !UT'IRS
4. ALL OF THE ABOE
QS 2. STARPROBE' WEB-BASED MULTI-USER -------- AAILABLE FOR ACADEMIC
INSTITUTIONS. ---------- PROIDES A SET OF PARTITIONED CLUSTERING ALGORITHUM
THAT TREAT THE CLUSTERING PROBLEM AS AN OPTIMIZATION PROCESS.
1. CLIENT' SOM
#$ SR*R / C'UT!
3. CLIENT' CLUTO
4. SERER' ESOM
QS 3. ESOM STANDS FOR --------- AND MML STANDS FOR ----------
1$ MR%"T S'(-!R%A"I0I"% MAPS/ MI"IMUM MSSA% '"%T)
2. EMERGING SELF OPERATING MEASURE' MAXIMUM MESSAGE LAST
3. EMITTED SELF ORGANIZING MEASURE' MAXIMUM MINIMUM LENGTH
4. NONE OF THE ABOE
QS 4. K-MEANS' HIERARCHICAL ' AGGLOMERATIE AND DIISIE ARE FOUR METHODS
OF -------. AND --------IS ONE OF THE SIMPLEST UNSUPERISED LEARNING ALGORITHMS
THAT SOLE THE WELL KNOWN CLUSTERING PROBLEM.
1. CLASSIFICATION ' K-MEANS
2. PREDICTION ' K-MEANS
-$ C'USTRI"%/ K-MA"S
4. ALL ARE CORRECT
QS !. CLUSTERING MA# ALSO BE CONSIDERED AS ------------ AND CLUSTERING IS ALSO
CALLED --------
1. SEGMENTATION' PARTITIONS WITH SIMILAR OB,ECTS
2. CLASSIFICATION' SEGMENTATION
3. PREDICTION ' COMPRESSION
&$ S%M"TATI!"/ A'' !( T) AB!*
QS ". $I%ASSOCIATION RULES THAT INOLE TWO OR MORE DIMENSION OR
PREDICATES CAN BE REFERRED TO AS MULTIDIMENSIONAL ASSOCIATION RULE.
$II% MULTIDIMENSIONAL ASSOCIATION RULES WITH NO REPEATED PREDICATES ARE
CALLED INTER DIMENSION ASSOCIATION RULE.
1. $I%TRUE' $II%FALSE
2. $I%TRUE' $II%TRUE
3. $I%FALSE' $II%FALSE
4. $I%FALSE' $II%TRUE
QS &. CLASSIFICATION AND PREDICTION ARE TWO FORMS OF
(I) 1$ DATA A"A',SIS
2.DECISION TREE
3. A AND B
4. NONE OF THESE
$II% CLASSIFICATION PREDICTS
A. CATEGORICAL LABELS
B. PREDICTION MODELS CONTINUED ALUED FUNCTION
C$ A A"D B
D. NONE OF THESE
QS (. DECISION TREE IS BASED ON
$I% 1. BOTTOM-DOWN TECHNIQUE
2 . TOP-DOWN TECHIQUE
3. DIIDE-AND-CONQUER MANNER
4. T!P-D!+" RCURSI* DI*ID-A"D-C!"QUR MA""R
$II%. RECURSIE PARTITIONING STOPS IN DECISION TREE WHEN
1. ALL SAMPLES FOR A GIEN NODE BELONG TO SAME CLASS.
2. THERE ARE NO REMAINING ATTRIBUTES ON WHICH SAMPLES MA# BE
FURTHER PARTITIONED.
3. THERE ARE NO SAMPLES FOR THE BRANCH TEST.
&$ A'' T) AB!*.
QS ). --------- WORKS TO REMOE THE NOISE FROM THE DATA THAT INCLUDES
TECHNIQUES LIKE BINNING ' CLUSTERING AND REGRESSION. THE ------- TECHNIQUES
USES ENCODING MECHANISMS TO REDUCED THE DATA SET SIZE.
1. CLUSTERING ' DATA REDUCTION
#$ SM!!T)I"%/ DATA C!MPRSSI!"
3. CLASSIFICATION' DATA PROCESSING
4. BINNING' DATA REDUCTION
QS 1*. OLTP AND OLAP EXPANDS AS
1$ !"-'I" TRA"SACTI!" PR!CSSI"% / !"-'I" A"A',SIS PR!CSSI"%
2. ON-LINE TEMPORAR# PROCESSING ' ON-LINE ANAL#SIS PROCESSING
3. ON-LINE TRANSACTION PROCESSING ' ON-LINE ACCURATE PROCESSING
4. ON-LINE TIME PROCESSING ' ON-LINE ANAL#SIS PROCESSING
QS 11. THE DATA WAREHOUSE IEW INCLUDES FACT TABLE AND --------TABLE . THE
BUSINESS QUER# IEW IS THE PERSPECTIE OF DATA IN THE DATA WAREHOUSE FROM
THE IEWPOINT OF THE -------
1. FACT ' PROGRAMMER
2. DIMENSION ' DEELOPER
3. FACT' END-USER
4. ALL ARE CORRECT
QS 12. THE ----- PERFORMS A STRUCTURED AND S#STEMATIC ANAL#SIS AT EACH STEP
BEFORE PROCEEDING TO THE NEXT WHISH IS LIKE A WATERFALL' FALLING FROM ONE
STEP TO NEXT. THE --------- INOLES THE RAPID GENERATION OF INCREASINGL#
FUNCTIONAL S#STEMS' WITH SHORT INTERALS BETWEEN SUCCESSIE RELEASES
1 +ATR(A'' MT)!D/ SPIRA' MT)!D
2. SPIRAL METHOD' WATERFALL METHOD
3. PROTOT#PE MODEL' SPIRAL METHOD
4. LINEAR METHOD' SPIRAL METHOD.
QS13 THE BOTTOM TIER IS A 111111111 DATABASE SERER THAT IS ALMOST ALWA#S
A RELATIONAL DATABASE S#STEM. DATA WAREHOUSE AND 1111111 TOOLS ARE BASED
ON OLTP DATA MODEL.
1$ +AR)!US/ !'AP
2. OLAP' ROLAP
3. ROLAP'OLTP
4. MOLAP' NONE OF THE ABOE
QS14 NOISE IS RANDOM ERROR OR ARIANCE IN MEASURED ARIABLE. SRSWR
STANDS FOR.
1$ TRU /SIMP' RA"D!M SAMP' +IT) RP'ACM"T
2. FALSE' SIMPLE RANDOM SAMPLE WITHOUT REPLACEMENT
QS1& THE DATA COMPRESSION TECHNIQUE USES ENCODING MECHANISMS TO 111111
THE DATE SET SIZE. TO DEAL WITH LARGER DATA SETS' A SAMPLING METHOD' CALLED
1111111111111
1. RDUC/ C'ARA
2. REASE' DARA
3. EQUAL' PAM
4. NONE' NONE OF THE ABOE
QS 1(. $I% A MA,ORIT# OF DATA MINING S#STEMS DO NOT USE AN# DBMS AND HAE
THEIR OWN MEMOR# AND STORAGE MGMT.
$II%DATA MINING SUPPORTS AUTOMATIC DATA EXPLORATION.
1. $I%TRUE $II% FALSE
#$ (I)TRU (II) TRU
3. $I%FALSE $II% FALSE
4. $I%FALSE $II% TRUE
QS 1). NEURAL NETWORKS' CLASSIFICATION' REGRESSION ' CLUSTERING AND
ASSOCIATION ARE DATA -------- TECHNIQUES' -------- MAKE USE OF EXISTING ARIABLES
IN THE DATABASE IN ORDER TO PREDICT UNKNOWN OR FUTURE ALUES OF INTEREST
1. MINING' PREDICTION
2. WAREHOUSING ' PREDICTION
3. MINING' DESCRIPTION
4. WAREHOUSING' DEDUCTION
QS 2*. $I% DATA CONSTRAINTS SPECIF# THE SET OF TASK RELEANT DATA
$II%RULE CONSTRAINTS SPECIF# THE FORM OF RULES TO BE MINED.
1. $I%TRUE $II% FALSE
#$ (I)TRU (II) TRU
3. $I%FALSE $II% FALSE
4. $I%FALSE $II% TRUE
&-MARKS QUSTI!"S
QS 1. THE ENTIT# RELATIONSHIP DATA MODEL IS COMMONL# USED IN THE DESIGN OF
-----------
WHERE A DATABASE -------- CONSISTS OF A SET OF ENTITIES AND THE RELATIONSHIPS
BETWEEN THEM . ER DATA MODEL IS APPROPRIATE FOR ------- PROCESSING. A --------
REQUIRES A CONCISE SUB,ECT-ORIENTED SCHEMA THAT FACILITATES ON-LINE DATA
ANAL#SIS.
1$ R'ATI!"A' DATABASS/ SC)MA/ !"-'I" TRA"SACTI!" / DATA+AR)!US
2. HIERARCHICAL DATABASES' SCHEMA' ON-LINE TRANSACTION ' DATA MINING
3. HIERARCHICAL DATABASES' SCHEMA' REAL-TIME TRANSACTION ' DATA MINING
4. RELATIONAL DATABASES' SCHEMA' ON-LINE TRANSACTION ' DATA
CLASSIFICATION
QS 2.$I% DATA WAREHOUSE AND OLAP TOOLS ARE NOT BASED ON MULTIDIMENSIONAL
DATA
$II% THE DATA SOURCE IEW EXPOSES THE INFORMATION BEING CAPTURED ' STROED
AND MANAGED B# OPERATIONAL S#STEMS
$III%RELATIONAL OLAP ARE THE INTERMEDIATE SERERS THAT STAND IN BETWEEN A
RELATIONAL BACK-END SERER AND CLIENT FRONT-END TOOLS
$I%A IRTUAL MACHINE IS A SET OF IEWS OER OPERATIONAL DATABASES
1. $I%TRUE $II%TRUE$III%TRUE$I%TRUE
#$ (I)(A'S (II)TRU(III)TRU(I*)TRU
3. $I%TRUE $II%TRUE$III%TRUE$I%FALSE
4. $I%TRUE $II%TRUE$III%FALSE$I%FALSE
QS 3. ANN' FP TREE' OLTP AND OLAP
1. ARTICRAFT NEURAL NETWORK' FREQUENT PATTERN TREE' ON-LINE
TEMPORAR# PROCESSING ' ON-LINE ANAL#SIS PROCESSING
#$ ARTI(ICIA' "URA' "T+!RK/ (RQU"T PATTR" TR/ !"-'I"
TRA"SACTI!" PR!CSSI"% / !"-'I" A"A',SIS PR!CSSI"%
3. ARTISTIC NEURAL NETWORK' FREQUENT PATTERN TREE' ON-LINE TEMPORAR#
PROCESSING ' ON-LINE ANAL#SIS PROCESSING
4. ARTICRAFT NEURAL NETWORK' FREQUENT PATTERN TREE' ON-LINE
TEMPORAR# PROCESSING ' ON-LINE ANAL#SIS PROCESSING
QS 4. ----------- SPECIF# THE T#PE OF KNOWLEDGE TO BE MINED. DATA CONSTRAINTS
SPECIF# THE SET OF ---------. DIMENSIONAL CONSTRAINTS SPECIF# THE DIMENSION OF
THE ---------- AND RULE CONSTRAINTS SPECIF# THE FORM OF ------ TO BE MINED
1. KNOWLEDGE T#PE CONSTRICTS' TIME-RELATED DATA' INFORMATION' RULE
2. KNOWLEDGE T#PE CONSTRICTS' TIME-RELATED DATA' INFORNATION' RULE
3. KNOWLEDGE T#PE CONSTRICTS' TIME-RELATED DATA' DATA' INTERESTINGNESS
&$ K"!+'D% T,P C!"STRICTS/ TASK-R'ATD DATA/ DATA/ RU'
QS !. K-MEAN' AGGLOMERATIE AND HIERACHICAL ARE METHODS OF -------SINGLE
LINK CLUSTERING ALSO CALLED -------- COMPLETE LINK CLUSTERING ALSO CALLED AS
--------- METHOD. ---------- IS USED FOR DATA MINING.
1. CLASSIFICATION' CONNECTEDNESS' DIAMETER' DATA WAREHOUSE
2. CLUSTERING' CONNECTEDNESS' AREA' CLUSTERING
-$ C'USTRI"%/ C!""CTD"SS/ DIAMTR/ C'USTRI"%
4. CLUSTERING' ISOLATED' DIAMETER' DATA MART
QS ".$I% CLUSTERING MA# ALSO BE CONSIDERED AS SEGMENTATION .
$II%SEGMENTATION' COMPRESSION ' AND PARTITIONS WITH SIMILAR OB,ECT ALL ARE
NOT CLUSTERING METHODS
$III%CLUSTERING IS NOT USED ONL# IN DATA MINING
$I%SUPERISED LEARNING IS REPRESENTED IN THE FORM OF CLUSTERING.
1. $I%TRUE $II%TRUE$III%TRUE$I%TRUE
2. $I%FALSE $II%TRUE$III%TRUE$I%TRUE
3. $I%TRUE $II%TRUE$III%TRUE$I%FALSE
&$ (I)TRU (II)(A'S(III)(A'S(I*)TRU
QS &. WEB CONTENT MINING' WEB STRUCTURE MINING AND WEB USAGE MINING
ALL COMES UNDER ------. AND --------- IS SIMPLE TEXT FILES THAT ARE
AUTOMATICALL# GENERATED EER# TIME SOMEONE ACCESSES ONE
WEBSITE .--------- IS A LINK ANAL#SIS THAT ASSIGNS A NUMERICAL WEIGHING TO
EACH ELEMENT OF A H#PERLINKED SET OF DOCUMENTS SUCH AS THE WORLD WIDE
WEB. --------- A SOFTWARE AGENT IS A COMPUTER PROGRAM WHICH RUNS ON AN
AGENT INTERACTION MACHINE
1$ +B MI"I"%/ '!% (I'/ PA% RA"K / +B A%"T
2. WEB WAREHOUSING' DATA FILE' PAGE RANK ' WEB AGENT
3. WEB MINING' LOG FILE' USER PROFILE ' WEB AGENT
4. WEB MINING' LOG FILE' PAGE RANK ' WEB MINING
QS (. ----------DATA QUALIT# SOLUTION PROIDES AN ENTERPRISE SOLUTION FOR
PROFILING CLEANSING' AUGMENTING AND INTEGRATING DATA TO CREATE
CONSISTENT ' RELAIABLE-------' WITH SAS DATA QUALIT# SOLUTION #OU CAN
AUTOMATICALL# INCORPORATED DATA QUALIT# INTO DATA INTEGRATION AND
-----------PRO,ECTS TO DRAMATICALL# IMPROE RETURNS ON #OUR ORGANIZATION
-S -----------INITATIES.
1$ SAS /I"(!RMATI!"/ BUSI"SS I"T''I%"C/ STRAT%IS
2. GNU' INFORMATION' BUSINESS INTELLIEGENCE' STRATEGIES
3. SAS' DECISIONS' BUSINESS INTELLIEGENCE' RULES
4. GNU' DATA' BUSINESS INTELLIEGENCE' POLICIES
QS ). WEKA IS A COLLECTION OF MACHINE LEARNING ALGORITHUM FOR -------TASKS'
THE ALGORITHUMS CAN EITHER BE APPLIED DIRECTL# TO A DATASET OR CALLED FROM
#OUR OWN ,AA CODE. WEKA CONTAINS TOOLS FOR DATA PREPROCESSING '
CLASSIFICATION' REGRESSION' CLUSTERING ' ASSOCIATION RULES AND-----------. IT IS
WELL SUITED FOR DEELOPING NEW MACHINE LEARNING------.
1. DATA WAREHOUSING' IMAGINATION' RULES
#$ DATA MI"I"%/ *ISUA'I0ATI!"/ SC)MS
3. DATA MINING' CALCULATIONS' STRATEGIES
4. DATA MART' ISUALIZATION' SCHEMES
QS 1*. WEB LOG ANAL#SIS HAS BEEN THE FOUNDATION OF ---------- ON THE WEB
IN --------- UNIQUEL# IDENTIF#ING USERS. A LOTS OF WORKS HAE BEEN DONE IN THE
INFORMATION RETRIEAL DATABASES INTELLIGENT AGENTS AND TOPOLOG# WHICH
PROIDES A SOUND FOUNDATION FOR THE ------------. WEB MINING IS THE APPLICATION
OF -----------.
1. DATA ISUALIZATION' DATA MINING' DATA MART CREATION' DATA MINING
2. DATA MINING' ISUALIZATION' SCHEMES' DATA WAREHOUSING
-$ DATA +AR)!USI"%/ +B MI"I"%/ +B C!"T"T MI"I"%/ DATA MI"I"%
4. E-COMMERCE' WEB MINING' CONTENT SEARCH' DATA WAREHOUSE
QS 11.$I%A USER SESSION IS A CLICK STREAM RECORD SPANNING THE ENTIRE WEB .
$II% WEB STRUCTURE DESCRIBES HOW A PAGE IS USED THE DATE AND TIME IT WAS
ACCESSED THE IP ADDRESSES OF THE BROWSER AD PAGE REFERENCES.
$III%WEB LOG FILES ARE FREQUENTL# USED IN SEQUENTIAL MINING.
$I%STRUCTURAL MINING IS USED TO EXAMINE THE STRUCTURE OF A PARTICULAR
WEBSITES AND COLLATE AND ANAL#ZE RELATED DATA.
1. $I%TRUE $II%TRUE$III%TRUE$I%TRUE
#$ (I)(A'S (II)TRU(III)TRU(I*)TRU
3. $I%TRUE $II%TRUE$III%TRUE$I%FALSE
4. $I%TRUE $II%TRUE$III%FALSE$I%FALSE
QS 12. EOS ' KDD' GDP' AND PRIM EXPANDS AS -------
1. EARL# OBSERATION S#STEM ' KNOWLEDGE DATABASE' GRAND DOMESTIC
PRODUCT ' PATIENT RULE INDUCTION METHOD
2. EARTH OBSERATION S#STEM ' KNOWLEDGE DATABASE' GROSS DOMESTIC
PRODUCT ' PEIODIC RULE INDUCTION METHOD
-$ ART) !BSR*ATI!" S,STM / K"!+'D% DATABAS/ %R!SS D!MSTIC
PR!DUCT / PATI"T RU' I"DUCTI!" MT)!D
4. EAS# OBSERATION S#STEM ' KNOWLEDGE DATABASE' GRAND DOMESTIC
PRODUCT ' PATIENT RULE INDUCTION METHOD
QS 13. INSURANCE AND DIRECT MAIL ARE TWO INDUSTRIES THAT REL# ON -------- TO
MAKE PROFITABLE BUSINESS DECISIONS. TO AID DECISION MAKING ANAL#SIS
CONSTRUCT ----- MODELS USING WAREHOUSE DATA TO PREDICT THE OUTCOMES OF
ARIET# OF DECISION ALTERNATIES. A --------PROFILE IS A MODEL THAT PREDICTS
FUTURE PURCHASING BEHAIOUR OF AN INDIIDUAL CUSTOMER'GIEN HISTORICAL
TRANSACTION DATA FOR BOTH THE INDIIDUAL AND FOR THE LARGER POPULATION OF
ALL OF A PARTICULAR COMPAN#+S CUSTOMERS. IT IS OFTEN BENEFICIAL TO -------
DATA INTO A SMALLER NUMBER OF POINTS ' EASING COMPUTATIONAL REQUIREMENTS
AND REDUCING THE AMOUNT OF NOISE.
1$ DATA A"A',SIS/ PRDICTI*/ PRDICTI*/ A%%R%AT
2. ALTERNATIE ANAL#SIS PREDICTIE' PREDICTIE' AGGREGATE
3. DATA ANAL#SIS' CLASSIFICATION' PREDICTIE' NOIS#
4. CLUSTER ANAL#SIS' PREDICTIE' PREDICTIE' AGGREGATE
QS 14. WIS ' DRG' MBA' HOLAP MEANS
1. WEIGHT ITEM SETS 'DIAGNOSIS RELATED GROUP' MEAN BASKET ANAL#SIS'
H#BRID OLAP
2. WEIGHTED ITEM SETS 'DIALOGUE RELATED GROUP' MARK BASKET ANAL#SIS'
H#BRID OLAP
3. WEIGHTED ITEM SETS 'DIAGNOSIS RELATED GROUP' MARKET BASKET
ANAL#SIS' HIERARCHICAL OLAP
&$ +I%)TD ITM STS /DIA%"!SIS R'ATD %R!UP/ MARKT BASKT
A"A',SIS/ ),BRID !'AP
QS 1!. DATA STORED IN MOST TEXT DATABASES ARE ---------- TEXT DATA BASES ARE
ALSO CALLED AS ---
---------- IS THE FIRST STEP IN TEXT RETRIEAL S#STEM' PRECISION ' RECALL AND F-
SCORE ALL ARE THE MEASURES OF THE TEXT ---------- DOCUMENTS.
1. SEQUENCE STRUCTURED' DOCUMENT DATABASES' TOKENIZATION' RETRIEAL
2. SEMI STRUCTURED' RELATIONAL DATABASES' TOKENIZATION' PROCESSING
-$ SMI STRUCTURD/ D!CUM"T DATABASS/ T!K"I0ATI!"/ RTRI*A'
4. STRUCTURED' DOCUMENT DATABASES' TOKENIZATION' FORMATTING