不确定时间序列的相似性匹配问题

确定性时间序列的相似性匹配方法都没有考虑数据的不确定性,而现实世界中传感器采集到的数据往往是不确定的,现有的时间序列的相似性匹配方法不适用于这些领域.针对此问题,将不确定性时间序列做预处理,把它分为横向时间维和纵向概率维,首先把给定的不确定时间序列用Haar小波变换进行压缩变换,在此基础上,对得到的不确定性时间序列概率维作纵向处理,提出一种选代表方法,即采用概率最大法、均值法等选出一条确定的时间序列.通过这2种预处理后,对得到的确定性时间序列进行降维和索引,根据查询序列和数据库中的时间序列中的各自的不确定性进行组合,分别提出对应组合的相似性匹配算法.     

不确定性对象的反向最近邻查询

多数不确定性对象的反向近邻查询不能明确回答某个不确定性对象是否为查询对象的反向最近邻,针对该问题,提出概率反向最近邻查询的概念,设计不确定性对象的概率反向最近邻查询的索引结构,给出一种基于该结构的不确定性对象的反向最近邻查询算法。     

面向存在不确定对象的组最近邻查询方法

组最近邻查询是空间对象查询领域的一类重要查询,通过该查询可找到距离给定查询点集最近的空间对象.由于图像分辨率或解析度的限制等因素,空间对象的存在不确定性广泛存在于某些涉及图像处理的查询应用中.这些对象位置数据的存在不确定性会对组最近邻查询结果产生影响.本文给出面向存在不确定对象的概率阈值组最近邻查询定义,设计了高效的查询处理机制,通过剪枝优化等手段提高概率阈值组最近邻查询效率,并进一步提出了高效概率阈值组最近邻查询算法.采用多个真实数据集对概率阈值组最近邻算法进行了实验验证,结果表明所提算法具有良好的查询效率.     

基于深度学习的可学习索引研究

如何对数据进行高效的检索一直是个热门话题。传统的索引方法在大数据环境下进行最近邻查找时,面临着查找速度慢、准确率不高等问题。为了保证检索效率,人们往往会牺牲一定的准确度来换取更高的查询效率。随着机器学习和神经网络的发展,采用基于深度学习的可学习索引模型,将检索过程使用神经网络的查找进行代替成为一种可行的方法。实验结果表明,在解决最近邻查找问题时,使用包含输入层、神经网络层、索引层和输出层等四个层次的深度学习模型,能够在保持一定查找准确率的基础上,在查找时间上取得优势。     

基于密度的不确定性数据概率聚类

近期传感数据监测和移动对象跟踪等许多从自然界直接采集数据的新应用引发了不确定性数据管理这一新的研究课题.这些应用中相关数据的不确定性为传统的数据处理方法提出了新的挑战.探讨的重点是不确定性数据的聚类.提出了一个针对不确定性数据的基于密度的聚类算法,根据不确定性数据内在的概率分布信息进行概率聚类,并采用R树索引和概率阀值索引提高算法的效率.仿真试验表明,提出的算法在有效性和效率方面均优于当前主要的基于密度的不确定性数据聚类算法.     

基于小波变换的时间序列相似模式匹配

提出了一种新的时序相似模式匹配方法，它采用小波分析的方法实现时间序列数据的降维，采用小波序列表示原序列，将小波序列组织为多维索引结构R-tree存储，在该索引结构基础上，基于一种表示相似性的距离函数，定义了范围查询和最近邻查询算法，实验结果证明这种方法性能优于传统的基于傅立叶变换的相似模式匹配方法。     

基于参考集索引的高效序列相似性查找算法

序列数据在文本、Web访问日志文件、生物数据库中普遍存在,对其进行相似性查找是一种重要的获取和分析知识的手段.基于参考集索引技术是一类解决序列相似性查找的有效方法,主要思想是找到序列数据库中的少数序列作为参考集,通过参考集过滤掉数据库中与查询序列不相关的数据,从而高效地回答查询.在现有基于参考集索引技术的基础上,提出一种过滤能力更强的序列相似性查询算法IRI(improved reference indexing).首先,充分利用了先前的查询结果集来加速当前的查询,其次考虑了基于序列特征的上界和下界,使得应用参考集进行过滤的上下界更紧,过滤能力进一步加强.最后,为了避免候选集中费时的编辑距离计算,则只计算前缀序列间的编辑距离,从而进一步加速算法运行.实验采用真实的DNA序列和蛋白质序列数据,结果表明,算法IRI在查询性能上明显优于现有的基于参考集索引方法RI(reference indexing).     

在时间序列相似性问题中滑动窗口的确定

作为一个非平凡命题,大多数时间序列相似性查找方法都涉及到了对原数据的维度简约.在保持原序列中有效信息量的同时,尽量降低计算复杂度是这些算法的关键.讨论滑动窗口在时间序列相似性降维技术中的实际应用,从中发现确定自适应滑动窗口大小的一种新方法.通过对时序特征值分布函数的挖掘,发现时间序列中的若干有效点,从而确定一组合适的滑动窗口大小,并根据序列变化的来决定最佳的滑动窗口.     

BioIndex：一种生物序列相似性查询的高效索引

有效管理生物数据并提供高效的查询方法是生物信息处理的重要研究内容.BioSeg是一个新的生物序列数据模型.查询优化研究是生物数据库管理系统开发的重要内容之一.研究当前生物数据索引技术,针对BioSeg数据模型的特点和生物序列相似性查询需求设计了一种新的生物序列数据索引BioIndex,并设计相应的查询算法.首先,使用MEME(Multiple EM for Moeif Elicitation)算法挖掘生物序列集中的序列模式作为索引建立索引序列库;之后,在索引序列库中查找与查询序列最相似的索引序列,将其对应的序列集作为候选集;再在候选集中查找与查询序列最相似的序列.在真实生物序列数据集上的实验表明使用新的生物序列数据索引BioIndex的序列查询算法提高了序列查询的效率.     

索引折半查找算法的研究与设计

当前对有序数列查找常用二分查找,但是二分查找具有一定的约束性和特殊情况下的低效性,为此研究并设计了索引折半查找算法,理论上其平均查找效率优于二分查找的平均查找效率。对比实验验证了索引折半查找算法的良好性能。     

Adaptive similarity search for the retrieval of rare events from large time series databases

Improving the recall of information retrieval systems for similarity search in time series databases is of great practical importance. In the manufacturing domain, these systems are used to query large databases of manufacturing process data that contain terabytes of time series data from millions of parts. This allows domain experts to identify parts that exhibit specific process faults. In practice, the search often amounts to an iterative query–response cycle in which users define new queries (time series patterns) based on results of previous queries. This is a well-documented phenomenon in information retrieval and not unique to the manufacturing domain. Indexing manufacturing databases to speed up the exploratory search is often not feasible as it may result in an unacceptable reduction in recall. In this paper, we present a novel adaptive search algorithm that refines the query based on relevance feedback provided by the user. Additionally, we propose a mechanism that allows the algorithm to self-adapt to new patterns without requiring any user input. As the search progresses, the algorithm constructs a library of time series patterns that are used to accurately find objects of the target class. Experimental validation of the algorithm on real-world manufacturing data shows, that the recall for the retrieval of fault patterns is considerably higher than that of other state-of-the-art adaptive search algorithms. Additionally, its application to publicly available benchmark data sets shows, that these results are transferable to other domains.     

An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes

This paper addresses a sequence- and machine-dependent batch scheduling problem on a set of unrelated-parallel machines where the objective is to minimize a linear combination of total weighted completion time and total weighted tardiness. In particular, batch scheduling disregards the group technology assumptions by allowing for the possibility of splitting pre-determined groups of jobs into batches with respect to desired lower bounds on batch sizes. With regard to bounds on batch sizes, the MILP model is developed as two integrated batching and scheduling phases to present the problem. A benchmark of small-size instances on group scheduling shows the superior performance of batch scheduling up to 37% reduction in the objective function value. An efficient meta-heuristic algorithm based on tabu search with multi-level diversification and multi-tabu structure is developed at three levels, which moves back and forth between batching and scheduling phases. To eliminate searching in ineffective neighborhoods and thus enhance computational efficiency of search algorithms, several lemmas are proposed and proven. The results of applying lemmas reflect up to 40% reduction in computational times. Comparing the optimal solutions found by CPLEX and tabu search shows that the tabu search algorithm could find solutions, at least as good as CPLEX but in incredibly shorter computational time. In order to trigger the search algorithm, two different initial solution finding mechanisms have been developed and implemented. Also, due to lack of a qualified benchmark for unrelated-parallel machines, a comprehensive data generation mechanism has been developed in a way that it fairly reflects the real world situations encountered in practice. The machine availability times and job release times are considered to be dynamic and the run time of each job differs on different machines based upon the capability of the machines.     

MapReduce Implementation of an Improved Xml Keyword Search Algorithm

Extensible Markup Language (XML) is commonly employed to represent and transmit information over the Internet. Therefore, how to effectively search for keywords of massive XML data becomes a new issue. In this paper, we first present four properties to improve the classical ILE algorithm. Then, a kind of parallel XML keyword search algorithm, based on intelligent grouping to calculate SLCA, is proposed and realized under MapReduce programming model. At last, a series of experiments are implemented on 7 datasets of different sizes. The obtained results indicate that the proposed algorithm has high execution efficiency and is applicable to keyword search of massive XML data.     

一个多维数据搜索算法

本文提出了一种使用二叉树组织多维数据的数据结构,在这种结构下提出了一个区域搜索算法,确定空间中给定点的区域内所有在给定数据集中的点,搜索效率与维数无关,算法的平均时间复杂性为O(logn),为了保证算法的效率,提出了一种平衡树操作算法。     

Preferred search over encrypted data

Cloud computing provides elastic data storage and processing services. Although existing research has proposed preferred search on the plaintext files and encrypted search, no method has been proposed that integrates the two techniques to efficiently conduct preferred and privacy-preserving search over large datasets in the cloud.In this paper, we propose a scheme for preferred search over encrypted data (PSED) that can take users’ search preferences into the search over encrypted data. In the search process, we ensure the confidentiality of not only keywords but also quantified preferences associated with them. PSED constructs its encrypted search index using Lagrange coefficients and employs secure inner-product calculation for both search and relevance measurement. The dynamic and scalable property of cloud computing is also considered in PSED. A series of experiments have been conducted to demonstrate the efficiency of the proposed scheme when deploying it in real-world scenarios.     

不确定时间序列的规约方法

为提高不确定时间序列的查询效率,在对不确定时间序列数据集进行建模的基础上,提出由不确定时间序列向确定时间序列的 3种规约方法,分别为概率最大法、混合规约法和均值法,并给出具体的规约过程。实验结果表明,上述3种规约方法能减少时间序列的不确定性,为其相似性匹配、搜索和查询操作提供依据。     

基于自适应搜索窗口的序列相似比对算法

DTW（Dynamic Time Warping）算法被广泛应用于序列数据比对,以度量序列间距离,但算法较高的时间复杂度限制了其在长序列比对上的应用。提出基于自适应搜索窗口的序列相似比对算法（ADTW）,算法利用分段聚集平均（Piecewise Aggregate Approximation,PAA）策略进行序列抽样得到低精度序列,然后计算低精度序列下的比对路径,并根据低精度距离矩阵上的梯度变化预测路径偏差,限制路径搜索窗口的拓展范围;随后算法逐步提高序列精度,并在搜索窗口内修正路径、计算新的搜索窗口,最终,实现DTW距离和相似比对路径的快速求解。对比FastDTW,ADTW算法在同等度量准确率下提高计算效率约20%,其时间复杂度为[O(n)]。     

Parameter-Free Search of Time-Series Discord

Time-series discord is widely used in data mining applications to characterize anomalous subsequences in time series. Compared to some other discord search algorithms, the direct search algorithm based on the recurrence plot shows the advantage of being fast and parameter free. The direct search algorithm, however, relies on quasi-periodicity in input time series, an assumption that limits the algorithm’s applicability. In this paper, we eliminate the periodicity assumption from the direct search algorithm by proposing a reference function for subsequences and a new sampling strategy based on the reference function. These measures result in a new algorithm with improved efficiency and robustness, as evidenced by our empirical evaluation.     

路径规划算法的改进及在车载导航中的应用

路径规划算法是车载导航的核心问题。充分利用启发式搜索具有方向性的启发信息,对A＊算法进行改进,采用双向的A＊算法来避免过多的节点搜索和搜索过界,不能得到正确结果的问题。同时,为了适合嵌入式平台的特殊环境,采用数据分层,搜索过程升层的方法,充分利用内存资源,减少外存I/O的工作量。并且结合上述策略,给出了改进的算法伪代码流程并对改进的A＊算法的进行验证。     

Mímir: An open-source semantic search framework for interactive information seeking and discovery

Semantic search is gradually establishing itself as the next generation search paradigm, which meets better a wider range of information needs, as compared to traditional full-text search. At the same time, however, expanding search towards document structure and external, formal knowledge sources (e.g. LOD resources) remains challenging, especially with respect to efficiency, usability, and scalability.This paper introduces Mímir—an open-source framework for integrated semantic search over text, document structure, linguistic annotations, and formal semantic knowledge. Mímir supports complex structural queries, as well as basic keyword search.Exploratory search and sense-making are supported through information visualisation interfaces, such as co-occurrence matrices and term clouds. There is also an interactive retrieval interface, where users can save, refine, and analyse the results of a semantic search over time. The more well-studied precision-oriented information seeking searches are also well supported.The generic and extensible nature of the Mímir platform is demonstrated through three different, real-world applications, one of which required indexing and search over tens of millions of documents and fifty to hundred times as many semantic annotations. Scaling up to over 150 million documents was also accomplished, via index federation and cloud-based deployment.