共查询到20条相似文献,搜索用时 156 毫秒
1.
2.
针对权重社会网络发布隐私保护中的弱保护问题,提出一种基于差分隐私模型的随机扰动方法可实现边及边权重的强保护。设计了满足差分隐私的查询模型-WSQuery,WSQuery模型可捕获权重社会网络的结构,以有序三元组序列作为查询结果集;依据WSQuery模型设计了满足差分隐私的算法-WSPA,WSPA算法将查询结果集映射为一个实数向量,通过在向量中注入Laplace噪音实现隐私保护;针对WSPA算法误差较高的问题提出了改进算法-LWSPA,LWSPA算法对查询结果集中的三元组序列进行分割,对每个子序列构建满足差分隐私的算法,降低了误差,提高了数据效用。实验结果表明,提出的隐私保护方法在实现隐私信息的强保护同时使发布的权重社会网络仍具有可接受的数据效用。 相似文献
4.
5.
6.
针对自然语言处理中查询主题漂移和词不匹配问题,提出基于CSC(Copulas-based Support and Confidence)框架的关联模式挖掘与规则扩展算法,并将基于统计学分析的关联模式与具有上下文语义信息的词向量融合,提出关联模式挖掘与词向量学习融合的伪相关反馈查询扩展模型.该模型对伪相关反馈文档集挖掘规则扩展词,对初检文档集进行词嵌入学习训练得到词向量,计算规则扩展词与原查询的向量相似度,提取向量相似度不低于阈值的规则扩展词作为最终扩展词.实验结果表明,所提扩展模型能有效地减少查询主题漂移和词不匹配问题,提高检索性能,与现有基于关联模式的和基于词向量的查询扩展方法比较,MAP(Mean Average Precision)平均增幅最大可达17.52%,对短查询更有效.所提挖掘方法可用于其他文本挖掘任务和推荐系统,以提高其性能. 相似文献
7.
目前P2P网络中数据查询在语义方面的研究较少,而基于DHT的数据检索只支持准确查询,导致查询准确率不高,但是好的索引项的建立会给查询带来很大的方便。本文结合了RDF和Word Net在语义方面的特点提出了一种新的简易RDF概念列表来表示文档,并通过计算语义相似度来决定输出结果的P2P数据查询方法。仿真实验证明本文方法可以较好的提高查询成功率。 相似文献
8.
三元组抽取的目的是从非结构化的文本中获取实体与实体间的关系,并应用于下游任务。嵌入机制对三元组抽取模型的性能有很大影响,嵌入向量应包含与关系抽取任务密切相关的丰富语义信息。在中文数据集中,字词之间包含的信息有很大区别,为了改进由分词错误产生的语义信息丢失问题,设计了融合混合嵌入与关系标签嵌入的三元组联合抽取方法(HEPA),提出了采用字嵌入与词嵌入结合的混合嵌入方法,降低由分词错误产生的误差;在实体抽取层中添加关系标签嵌入机制,融合文本与关系标签,利用注意力机制来区分句子中实体与不同关系标签的相关性,由此提高匹配精度;采用指针标注的方法匹配实体,提高了对关系重叠三元组的抽取效果。在公开的Du IE数据集上进行了对比实验,相较于表现最好的基线模型(Cas Rel),HEPA的F1值提升了2.8%。 相似文献
9.
由于随机观测矩阵的随机性,存在数据存储量大、内存占用率高、数据计算量大以及难以面向大规模实际应用等问题.为此,提出了一种可有效降低随机观测矩阵所占存储空间的半张量积压缩感知(STP-CS)方法.利用该方法,构建低维随机观测矩阵,经奇异值分解(SVD)优化后对原始信号进行采样,并利用拟合0-范数的迭代重加权方法进行重构.实验利用2维灰度图像进行测试,并对重构图像的峰值信噪比,结构相似度等指标进行了统计和比较.实验结果表明,本文所述的STP-CS方法在不改变随机观测矩阵数据类型的前提下,可将观测矩阵减小至传统CS模型中观测矩阵所占内存空间的1/256(甚至更低),同时仍保持很高的重构质量. 相似文献
10.
压缩感知重建是解决高光谱现有成像模式数据量大冗余度高问题的一个有效机制。针对高光谱图像的多通道特性,该文建立了高光谱压缩感知的多测量向量模型,编码端使用随机卷积算子对各通道进行快速采样,生成测量向量矩阵。解码端构建图稀疏正则化的联合重建模型,在稀疏变换域将高光谱图像分解为谱间的关联成分和差异成分,通过图结构化稀疏度量表征关联成分的空谱相关性,并约束谱间差异成分的稀疏性。进一步提出模型求解的交替方向乘子迭代算法,通过引入辅助变量与线性化技巧,使得每一子问题均存在解析解,降低了模型求解的复杂度。对多个实测数据集进行了对比实验,实验结果验证了该文模型与算法的有效性。 相似文献
11.
12.
With the deployment of wireless sensor networks (WSNs) for environmental monitoring and event surveillance, WSNs can be treated as virtual databases to respond to user queries. It thus becomes more urgent that such databases are able to support complicated queries like skyline queries. Skyline query which is one of popular queries for multi-criteria decision making has received much attention in the past several years. In this paper we study skyline query optimization and maintenance in WSNs. Specifically, we first consider skyline query evaluation on a snapshot dataset, by devising two algorithms for finding skyline points progressively without examining the entire dataset. Two key strategies are adopted: One is to partition the dataset into several disjoint subsets and produce the skyline points in each subset progressively. Another is to employ a global filter that consists of some skyline points in the processed subsets to filter out unlikely skyline points from the rest of unexamined subsets. We then consider the query maintenance issue by proposing an algorithm for incremental maintenance of the skyline in a streaming dataset. A novel maintenance mechanism is proposed, which is able to identify which skyline points from past skylines to be the global filter and determine when the global filter is broadcast. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithms on both synthetic and real sensing datasets, and the experimental results demonstrate that the proposed algorithms significantly outperform existing algorithms in terms of network lifetime prolongation. 相似文献
13.
14.
Convolutional neural networks (CNN) have achieved outstanding face recognition (FR) performance with increasing large-scale face datasets. With face dataset size grown, noisy data will inevitably increase, undoubtedly bringing difficulties to data cleaning. In this paper, the probability that the sample belongs to noise can be determined based on the cosine distance (cos) of normalized angle center and face feature vector in the margin-based loss functions. According to this finding, we propose a two-step learning method integrated into the loss function. The new proposed directional margin loss function combines the noise probability with the label as the supervision information. Experiments show that our method can tolerate noisy data and get high FR accuracy when the training datasets mix with more than 30% noise. Our approach can also achieve a great result of 79.33% in MegaFace challenge one using a noisy training dataset. 相似文献
15.
针对实际工程应用中由于滚动轴承故障状态出现的时间很短而导致数据集不平衡难以采用深度学习算法进行故障诊断的问题,提出了一种基于Wasserstein距离的梯度惩罚生成对抗网络(WGAN GP)和基于支持向量机分类的卷积神经网络(CNN SVM)相结合的滚动轴承故障红外诊断方法。从红外热像图中构建不平衡数据集,通过采用WGAN GP对不平衡数据扩充以达到数据集均衡,之后将CNN SVM模型应用于数据集,提取样本深度特征完成故障分类。实验表明,WGAN GP与CNN SVM相结合的模型在不平衡数据集下表现良好,相较于其他模型有更好的故障诊断能力,并且在故障分类阶段的用时可减少1689以上。 相似文献
16.
Recently, Linked Open Data has become a large set of knowledge bases. Therefore, the need to query Linked Data using question answering (QA) techniques has attracted the attention of many researchers. A QA system translates natural language questions into structured queries, such as SPARQL queries, to be executed over Linked Data. The two main challenges in such systems are lexical and semantic gaps. A lexical gap refers to the difference between the vocabularies used in an input question and those used in the knowledge base. A semantic gap refers to the difference between expressed information needs and the representation of the knowledge base. In this paper, we present a novel method using an ontology lexicon and dependency parse trees to overcome lexical and semantic gaps. The proposed technique is evaluated on the QALD‐5 benchmark and exhibits promising results. 相似文献
17.
18.
In this paper, a new approach has been proposed for improved facial expression recognition. The new approach is inspired by the compressive sensing theory and multiresolution approach to facial expression problems. Initially, each image sample is decomposed into desired pyramid levels at different sizes and resolutions. Pyramid features at all levels are concatenated to form a pyramid feature vector. The vectors are further reinforced and reduced in dimension using a measurement matrix based on compressive sensing theory. For classification, a multilevel classification approach based on single-branch decision tree has been proposed. The proposed multilevel classification approach trains a number of binary support vector machines equal to the number of classes in the datasets. Class of test data is evaluated through the nodes of the tree from the root to its apex. The results obtained from the approach are impressive and outperform most of its counterparts in the literature under the same databases and settings. 相似文献
19.
20.
该文提出一种改进的带虚拟领导的Flocking模型,并基于此模型开发了一种数据聚类算法。在此算法中,数据集中的数据点被考虑为可以在空间中移动的Agent,并且根据改进的模型,生成有权无向图。然后从数据集中选定一组虚拟领导,每个数据点与其中个虚拟领导建立连接。所有与这个数据点有连接的邻居,都通过一个势函数产生场,对这个数据点进行作用,此数据点将沿着所有场矢量叠加的方向移动一段距离。算法中,虚拟领导的加入有效减少了数据点,特别是邻居较少的数据点向某个中心收敛的时间。在所有数据点不断受到作用而移动的过程中,同类的数据点就会逐渐地聚集到一起,而不同类的数据点则相互远离,最后自动形成聚类。此算法的实验结果表明,数据点能合理有效地被聚类,并且算法具有较快的收敛速度,同时,与其他算法对比也验证了此算法的有效性。 相似文献