检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:JIN CheQing ZHOU MinQi ZHOU AoYing
出 处:《Science China(Information Sciences)》2011年第10期2028-2039,共12页中国科学(信息科学)(英文版)
基 金:supported by the Key Program of National Natural Science Foundation of China (Grant No.60933001);the National Natural Science Foundation of China (Grant No.60803020);the Natural Science Foundation of China (Grant No.61021004);Shanghai Leading Academic Discipline Project (Project No.B412);The research of Aoying Zhou was supported by the National Science Foundation for Distinguished Young Scholars (Grant No.60925008)
摘 要:The essence of uncertain data management has been well adopted since data uncertainty widely exists in lots of applications, such as Web, sensor networks, etc. Most of the uncertain data models are based on the possible world semantics. Because the number of the possible worlds will blowup exponentially with the growth of the data set, it is much more challenging to handle uncertain data than deterministic data. In this paper, we take the first attempt to study the rarity, an important statistic that describes the proportion of items with the same frequency, upon uncertain data. We have proposed three novel solutions, including an exact method and an approximate method to compute the rarity of a given frequency respectively, and a method to find the frequency of the maximum rarity. Analysis in theorem and extensive experimental results demonstrate the effectiveness and efficiency of the proposed solutions.The essence of uncertain data management has been well adopted since data uncertainty widely exists in lots of applications, such as Web, sensor networks, etc. Most of the uncertain data models are based on the possible world semantics. Because the number of the possible worlds will blowup exponentially with the growth of the data set, it is much more challenging to handle uncertain data than deterministic data. In this paper, we take the first attempt to study the rarity, an important statistic that describes the proportion of items with the same frequency, upon uncertain data. We have proposed three novel solutions, including an exact method and an approximate method to compute the rarity of a given frequency respectively, and a method to find the frequency of the maximum rarity. Analysis in theorem and extensive experimental results demonstrate the effectiveness and efficiency of the proposed solutions.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.157