结合示例空间概念权重的多示例核学习方法?

提出了一种考虑包中样本在概念空间中重要度的多示例核学习方法。引入了包中示例对整个样本空间所包含概念的权重向量。通过数量化的手段表示出每个示例从属于每个概念的重要程度。主要步骤如下:a)通过对所有示例进行聚类,得到能够反映多示例包中所含概念的簇;b)借用文本分类中的r-pattern计算得到每个示例对于概念空间中每个概念的权重向量;c)在多示例核中通过余弦相似度结合示例的权重,得到更能反映概念空间特性的多示例概念核。该方法同时考虑了包层次的概念和示例层次的权重,能够有效度量包中示例对于最终包标记的影响,且本身建立在多示例核的基础上,适用于多种多示例学习的场合。在标准数据集和图像数据集上的实验表明,该算法是有效的。     

构建新包空间的多示例学习方法

针对已有神经网络方法采用示例决定标记从而导致多示例学习(MIL)中包结构信息丢失的问题,提出了一种新的RK_BP多示例学习方法.在示例空间,首先采用粗糙集对其进行属性约简;然后进行K均值聚类,利用聚类点构造新包空间;在新空间中,利用误差反向传播神经网络算法进行分类.在多个测试数据集上对算法进行测试,结果表明该算法可有效解决已有神经网络方法包结构信息丢失问题,明显提高分类性能.     

基于深度特征选择的多示例算法及在图像分类中的应用

信息技术高速发展为人们生活带来便利的同时,海量的信息也给人们带来许多困扰,如图像检索变得越来越困难。因此智能化地进行图像分类识别具有重要的研究意义。基于多示例学习的图像分类方法得到了越来越多学者关注,。也提出了一些算法,但仍存在特征表达有限,模型受无关示例影响较大的问题。文章提出一种基于深度特征选择的多示例算法,并验证了此算法的有效性。该方法首先利用深度预训练模型提取示例高层语义特征,再将包投影到示例获取图像的深度特征,然后通过特征选择剔除干扰示例的影响,最后利用训练好的SVM分类器对图片类别进行预测。不同数据集上的实验结果表明,该方法有效地实现了图像分类。     

基于谱聚类和多示例学习的图像检索方法

针对基于对象的图像检索问题,提出一种新的谱聚类多示例学习算法.该算法将图像当作包,将分割区域的视觉特征当作包中的示例,针对正包示例集合进行谱聚类,按聚类中心点数最大原则选择潜在正示例中心和潜在正示例代表,并采用径向基函数和金字塔核分别度量潜在正示例间和其它示例间的相似性,最后利用支持向量机和相关反馈实现图像检索.采用S...     

基于类别空间多示例学习的色情图像过滤算法

针对传统的不良图像自动过滤算法难以适用于复杂互联网环境的问题，提出一种通过构建类别空间进行多示例学习实现图像过滤的新算法.首先在YCgCr空间中扩展Hessian矩阵检测特征点作为图像的示例，然后定义YCgCr-LBP算子作为图像示例描述符，最后基于包示例频率统计原理提出类别空间模型，并利用余弦相似度完成图像识别.利用不同成分的数据集进行了多组实验对比，结果表明，所提出的算法克服了传统依靠皮肤比例方法对皮肤或类皮肤比例较大图像识别准确度较低的问题，同时也较一般的多示例学习方法对图像具有更好的描述能力，取得了较好的实验结果，具有实际应用价值.     

基于在线多示例学习的协同训练目标跟踪算法

为解决把多示例学习应用到目标跟踪算法而导致的误差积累问题, 结合协同训练方法, 提出一种新的目标跟踪算法。该算法利用协同训练克服分类器自训练带来的误差积累, 同时在线多示例学习提高了跟踪效果的鲁棒性。将跟踪结果中心与理想目标位置中心的误差作为评价标准, 在标准视频序列上将跟踪结果与半监督学习跟踪算法和传统多示例学习跟踪算法进行对比。实验结果表明, 该方法在背景光照变化、目标旋转等复杂条件下, 可很好地跟踪目标, 具有较好的鲁棒性。     

一种基于聚类的图卷积多示例学习算法

基于图结构的多示例学习可用于解决挖掘包中示例间相关性问题.然而,现有的方法大多随机选择包中示例构建图结构,忽略了包中具有代表性示例对图结构的影响;同时都是间接在包图结构上建立分类器,造成了模型运行效率低下的问题.针对上述问题,提出了一种基于聚类的图卷积多示例学习算法MIL-GCC,首先通过聚类方法获取每个包中的超示例,作为包图结构中的节点;然后通过挖掘超示例间关系构建包图的边,确定包图结构;最后利用图卷积对包图节点重要度分数进行学习,直接在包图结构上建立分类器.实验表明:MIL-GCC可以充分表示包图结构,有效提高分类模型的质量.     

多示例学习的两阶段实例选择和自适应包映射算法

多示例学习(Multi-Instance Learning,MIL)研究对象的内部结构比单示例学习更加复杂.已有的MIL方法大都基于原始空间中的实例进行包映射,但这些方法通常忽略包的内部结构信息,难以保证所选实例与包在新特征空间中的关联性.提出一种多示例学习的两阶段实例选择和自适应包映射(TAMI)算法.首先,实例选择...     

基于多示例学习的遥感图像检索

将基于多示例学习的相关反馈技术应用到遥感图像检索中.为了避免局部最小值和减少冗余计算量,对传统的多示例学习算法--多样密度算法进行了改进.改进的算法利用用户标注的样本学习得到的查询概念,指导下一轮检索.为了提高查准率,综合学习得到的查询概念,提出了查询概念集来取代查询概念.实验结果表明,该算法比传统方法具有更好的检索性能.     

基于包层多示例主动学习的图像检索

通过详细分析多示例主动学习的特点,提出将多示例主动学习概括为包层、示例层以及混合层次主动学习三种模式;针对包层主动学习,将示例数目统计特征作为重要度量并与样本不确定性相结合,提出一种新的样本选择策略.在Corel数据集上进行实验,与传统的主动学习方法比较表明,该算法能够有效减少学习的样本数,显著提高学习器的效率和性能.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.