data wrangling_在线真题试卷与模拟练习_data wrangling

更新时间：试题数量：购买人数：提供作者：

有效期：个月

章节介绍：共有个章节

我的练习

我的错题
(0道)

我的收藏
(0道)

我的斩题
(0道)

我的笔记
(0道)

专项练习

顺序练习 0 / 0

随机练习 自定义设置练习量

题型乱序 按导入顺序练习

模拟考试 仿真模拟

题型练习 按题型分类练习

易错题 精选高频易错题

学习资料 考试学习相关信息

搜索

题库预览

Data integration can be either virtual or physical.

In schema matching, elements will always have one-to-one matching.

Some problems of traditional blocking can be overcome by carefully selecting the attributes to be used as blocking keys.

（含图）

Group record linkage refers to finding records that belong to the same real-world person in multiple (more than two) databases.

One advantage of active learning in record linkage is that it removes the workload of the domain expert who labels record pairs into matches and non-matches.

Given a list of nine values L = [5, 20, 5, 101, 9, 15, 42, 99, 7], when smoothed by bin median with 3 bins of equal frequency what would be the median value in the last bin?

Given a list of values L = [87, 11, 90, 35, 42, 50, 10, 17, 88, 76, 13], apply min-max (0-1) normalisation.

For the value l = 35 in the list L, what will its normalised value be after this min-max normalisation?

Assume we have the following two name strings:

s1 = "janan"

s2 = 'janna'

Calculate the q-gram based Dice-coefficient similarity between s1 and s2 considering bigrams (q=2).

Your answer needs to be rounded to 2 decimal places (for example: 0.42)

Assume you have two databases and they both contain 10% errors in the attribute weekday of birth day, where this attribute can contain the seven values "Monday" to "Sunday".

Also assume each of the seven possible values ("Monday" to "Sunday") occurs with equal frequency in the records in both databases.

Following the weight calculations used in probabilistic record linkage, what is the agreement weight for this attribute?

Your answer needs to be rounded to 3 digits after the decimal point (for example: 0.987)

Assume you need to deduplicate a database that contains 6,000 records. You apply a blocking technique and a total of 1,180,000 candidate record pairs are generated by your blocking technique.

What is the reduction ratio of this blocking technique on this database?

Your answer needs to be rounded to 3 decimal places (for example: 0.123)

Assume a record linkage process applied on two databases has predicted (classified) 4600 record pairs as matches. If the precision of the record linkage is 0.875, what is the number of record pairs that the linkage process incorrectly classified as matches (FP)?

Given a list of 12 values L = [14, 51, 6, 78, 101, 24, 6, 12, 78, 64, 120, 2], when smoothed by bin median with 3 bins of equal frequency what would be the second value in the last bin?

Assume a list of values L = [23, 45, 78, 12, 39, 5, 105, 41, 32, 50]. What is the maximum value after performing z-score normalisation on this list (please consider the population standard deviation)?

Round your answer to 2 decimal places (eg: 5.41)

Assume we have the following two name strings:

s1 = "daniel"

s2 = 'danyel'

Calculate the q-gram based Jaccard similarity between s1 and s2 considering bigrams (q=2).

Your answer needs to be rounded to 2 decimal places (for example: 0.52)

Assume you need to deduplicate a database that contains 2,500 records. You apply a blocking technique and a total of 500,000 candidate record pairs are generated by your blocking technique.

What is the reduction ratio of this blocking technique on this database?

Your answer needs to be rounded to 4 decimal places (for example: 0.1533)

（含图）

1 2 3 4 5 6 7