|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A retrospective of knowledge graphs显示文摘 | Jihong YAN Chengyu WANG Wenliang CHENG Ming GAO Aoying ZHOU | 2018 | Frontiers of Computer Science2018，12，1： | 25 |
| 2 | Towards modeling popularity of microblogs显示文摘 | Haixin MA Weining QIAN Fan XIA Xiaofeng HE Jun XU Aoying ZHOU | 2013 | Frontiers of Computer Science2013，7，2： | 8 |
| 3 | Continuous ranking on uncertain streams显示文摘数据无常广泛地在许多网应用,金融应用和传感器网络存在。与最大的评价分数返回很多个元组的评价询问在数据库管理的域里是重要的。大多数存在工作集中于为各种各样的评价建议静态的答案在不明确的数据上的语义。我们的焦点是处理连续的在不明确的数据流上评价询问:严峻的各新的元组将输出高度评价的元组。当新元组到达时,主要挑战来自可能的世界空间将指数地种的事实不仅,而且为低空间复杂性和时间复杂性到的要求适应流的环境。这份报纸在不明确的数据溪流上在处理连续评价瞄准询问。我们首先学习怎么确切处理这个问题,然后,我们建议一个新奇方法(指数的采样) 估计一个元组的期望的等级与高质量。在理论和详细试验性的报告的分析评估建议方法。 | Cheqing JIN Jingwei ZHANG Aoying ZHOU | 2012 | Frontiers of Computer Science2012，6，6： | 3 |
| 4 | EnAli:entity alignment across multiple heterogeneous data sources显示文摘Entity alignment is the problem of identifying which entities in a data source refer to the same real-world entity in the others.Identifying entities across heterogeneous data sources is paramount to many research fields,such as data cleaning,data integration,.information retrieval and machine learning.The aligning process is not only overwhelmingly expensive for large data sources since it involves all tuples from two or more data sources,but also need to handle heterogeneous entity attributes.In this paper,we propose an unsupervised approach,called EnAli,to match entities across two or more heterogeneous data sources.EnAli employs a generative probabilistic model to incorporate the heterogeneous entity attributes via employing exponential family,handle missing values,and also utilize the locality sensitive hashing schema to reduce the candidate tuples and speed up the aligning process.EnAli is highly accurate and efficient even without any ground-truth tuples.We illustrate the performance of EnAli on re-identifying entities from the same data source,as well as aligning entities across three real data sources.Our experimental results manifest that our proposed approach outperforms the comparable baseline. | Chao KONG Ming GAO Chen XU Yunbin FU Weining QIAN Aoying ZHOU | 2019 | Frontiers of Computer Science2019，13，1： | 2 |
| 5 | Adaptive indexing for content-based search in P2P systems 显示文摘 | AOYING ZHOU RONG ZHENG | 2008 | Data&Knowledge Engineering2008，67，： | 1 |
| 6 | Computing rarity on uncertain data显示文摘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. | JIN CheQing ZHOU MinQi ZHOU AoYing | 2011 | Science China(Information Sciences)2011，54，10： | 1 |
| 7 | A survey of uncertain data management technology research显示文摘 | Zhou Aoying Jin Cheqing Wang Guoren | 2009 | Chinese Journal of Computers2009，32，1： | 1 |
| 8 | An adaptive and dynamic dimensionality reduction method for hiigh-dimensional indexing显示文摘 | Shen Hengtao Zhou Xiaofang Zhou Aoying | 2007 | Vldb Jour Nal2007，16，2： | 1 |
| 9 | Product-oriented review summarization and scoring显示文摘 | Rong ZHANG Wenzhe YU Chaofeng SHA Xiaofeng HE Aoying ZHOU | 2015 | Frontiers of Computer Science2015，9，2： | 1 |
| 10 | An adaptive and dynamic dimensionality reduction method for high-dimensional indexing显示文摘 | Shen Hengtao Zhou Xiaofang Zhou Aoying | 2007 | Journal of VLDB2007，16，2： | 1 |
| 11 | Moble- Agent Based Distributed WebGIS 显示文摘 | GUAN Jihong ZHOU Shuigeng ZHOU Aoying | 2011 | Lecture Notes in Computer Science2011，，2172： | 1 |
| 12 | An efficient peer-to- peer indexing tree structure for multidimensional data 显示文摘 | Zhang Rong Qian Weining Zhou Aoying | 2009 | Future Generation Computer Systems2009，25，1： | 1 |
| 13 | Fault-tolerant precise data access on distributed log-structured merge-tree显示文摘Log-structured merge tree has been adopted by many distributed storage systems. It decomposes a large database into multiple parts: an in?writing part and several read-only ones. Records are firstly written into a memoryoptimized structure and then compacted into in-disk struc? tures periodically. It achieves high write throughput. However, it brings side effect that read requests have to go through multiple structures to find the required record. In a distributed database system, different parts of the LSM-tree are stored in distributed fashion. To this end, a server in the query layer has to issues multiple network communications to pull data items from the underlying storage layer. Coming to its rescue, this work proposes a precise data access strategy which includes: an efficient structure with low maintaining overhead designed to test whether a record exists in the in?writing part of the LSM-tree;a lease-based synchronization strategy proposed to maintain consistent copies of the structure on remote query servers. We further prove the technique is capable of working robustly when the LSM-Tree is re?organizing multiple structures in the backend. It is also fault-tolerant, which is able to recover the structures used in data access after node failures happen. Experiments using the YCSB benchmark show that the solution has 6x throughput improvement over existing methods. | Tao ZHU Huiqi HU Weining QIAN Huan ZHOU Aoying ZHOU | 2019 | Frontiers of Computer Science2019，13，4： | 1 |
| 14 | Efficient clustering of uncertain data streams显示文摘 | Cheqing Jin Jeffrey Xu Yu Aoying Zhou etal | 2013 | Knowledge and Information Systems2013，，： | 1 |
| 15 | Popular route planning with travel cost estimation from trajectories显示文摘With the increasing number of GPS-equipped vehicles,more and more trajectories are generated continuously,based on which some urban applications become feasible,such as route planning.In general,popular route that has been travelled frequently is a good choice,especially for people who are not familiar with the road networks.Moreover,accurate estimation of the travel cost(such as travel time,travel fee and fuel consumption)will benefit a wellscheduled trip plan.In this paper,we address this issue by finding the popular route with travel cost estimation.To this end,we design a system consists of three main components.First,we propose a novel structure,called popular traverse graph where each node is a popular location and each edge is a popular route between locations,to summarize historical trajectories without road network information.Second,we propose a self-adaptive method to model the travel cost on each popular route at different time interval,so that each time interval has a stable travel cost.Finally,based on the graph,given a query consists of source,destination and leaving time,we devise an efficient route planning algorithmwhich considers optimal route concatenation to search the popular route from source to destination at the leaving time with accurate travel cost estimation.Moreover,we conduct comprehensive experiments and implement our system by a mobile App,the results show that our method is both effective and efficient. | Huiping LIU Cheqing JIN Aoying ZHOU | 2020 | Frontiers of Computer Science2020，14，1： | 1 |
| 16 | Personalized query evaluation in ring-based P2P networks显示文摘 | Minqi Zhou Heng Tao Shen Xueqing Gong Weining Qian Aoying Zhon | | 0，，220： | 1 |
| 17 | Requirements and chal- lenges of the management of uncertain data显示文摘 | Li Jianzhong Yu Ge Zhou Aoying | 2009 | Communica- tions of the China Computer Federation2009，5，4： | 1 |
| 18 | Optimizing top-k retrieval: submodularity analysis and search strategies显示文摘 | Chaofeng SHA Keqiang WANG Dell ZHANG Xiaoling WANG Aoying ZHOU | 2016 | Frontiers of Computer Science2016，10，3： | 1 |
| 19 | Mobile-Agent Based Distributed WebGIS显示文摘 | Jihong Guan Shuigeng Zhou Aoying Zhou | 2001 | Lecture Notes in Computer Science2001，2172，： | 1 |
| 20 | Data intensive computing-challenges of data management techniques显示文摘 | Zhou Aoying | 2009 | Communications of CCT2009，5，7： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员