检索结果-内蒙古大学图书馆

Creating knowledge and Wisdom via Big data Analytics: Preface for ITQM 2017

Procedia Computer Science 2017年 122卷 1-9页

作者： Ahuja, Vandana Shi, Yong Khazanchi, Deepak Abidi, Naseem Tian, Yingjie Berg, Daniel Tien, James M. Jaypee Business School A-10 Sector-62 Noida Uttar Pradesh201 307 India School of Economics and Management University of Chinese Academy of Sciences Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha Chinese Academy of Sciences OmahaNE68182 United States College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

Predicting visual features from text for image and video caption retrieval

arXiv

引用

arXiv 2017年

作者： Dong, Jianfeng Li, Xirong Snoek, Cees G.M. College of Computer Science and Technology Zhejiang University Hangzhou310027 China Key Lab of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China Informatics Institute University of Amsterdam Amsterdam1098 XH Netherlands

This paper strives to find amidst a set of sentences the one best describing the content of a given image or video. Different from existing works, which rely on a joint subspace for their image and video caption retrieval, we propose to do so in a visual space exclusively. Apart from this conceptual novelty, we contribute Word2VisualVec, a deep neural network architecture that learns to predict a visual feature representation from textual input. Example captions are encoded into a textual embedding based on multi-scale sentence vectorization and further transferred into a deep visual feature of choice via a simple multi-layer perceptron. We further generalize Word2VisualVec for video caption retrieval, by predicting from text both 3-D convolutional neural network features as well as a visual-audio representation. Experiments on Flickr8k, Flickr30k, the Microsoft Video Description dataset and the very recent NIST TrecVid challenge for video caption retrieval detail Word2VisualVec's properties, its benefit over textual embeddings, the potential for multimodal query composition and its state-of-the-art results. Copyright © 2017, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Metric based on multi-order spaces for cross-modal retrieval

Metric based on multi-order spaces for cross-modal retrieval

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Liang Zhang Bingpeng Ma Guorong Li Qingming Huang Key Laboratory of Big Data Mining and Knowledge Management CAS China School of Computer and Control Engineering University of Chinese Academy of Sciences China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. CAS China

ISBN: (纸本)9781509060689

This paper proposes a novel method for cross-modal retrieval. Different from vector (text)-to-vector (image) framework of the traditional cross-modal methods, we adopt a vector (text)-to-matrix (image) framework. We assume that compared with vectors, matrices can directly represent images and characterize the structure of feature space. Furthermore, we propose a Metric based on Multi-order spaces (MMs). Multi-order statistic features are used to represent images for enriching the semantic information, and metrics among the multi-spaces are jointly learned to measure the similarity between two different modalities. Specifically, there are three steps for MMs. First, we jointly use the bags of visual features (zero-order), mean (first-order) and covariance (second-order) to characterize each image. Second, considering that covariance matrices and vectors lie on a Riemannian manifold and an Euclidean space respectively, we embed multi-order spaces into their corresponding Hilbert spaces to reduce the heterogeneity among the original spaces. Finally, the similarity between two different modalities can be measured by learning multiple transformations from the different Hilbert spaces to a common subspace. The performance of the proposed method over the state-of-the-art has been demonstrated through the experiments on two public datasets.

关键词： Hilbert space Manifolds Correlation Covariance matrices Feature extraction Linear programming

来源：评论

学校读者我要写书评

暂无评论

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exp...

引用

IEEE International Conference on data engineering

作者： Yu Sun Rui Zhang Andy Yuan Xue Jianzhong Qi Xiaoyong Du Department of Computing and Information Systems University of Melbourne Renmin University of China and Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)9781509020218

We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.

关键词： Heating Radio frequency Indexes

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and Computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Random analysis of statistical rough set

Random analysis of statistical rough set

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Eric C. C. Tsang Su-Yun Zhao Faculty of Information Technology Macau University of Science and Technology Macau China MOE Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Beijing China

ISBN: (纸本)9781509003914

Attribute reduction is an inevitable problem in machine learning and statistical learning. To improve the traditional rough set reduction, statistical rough sets is then proposed by introducing random sampling into the rough approximation. Random sampling is the main contribution of statistical rough sets. As a result, it is necessary to analyze the randomness of statistical rough sets. In this paper, we analyze and demonstrate the influence of the randomness in the process of attribute reduction by a large number of experiments to test the effectiveness and stability of the random sampling.

关键词： Rough sets Standards Cybernetics Fluctuations Stability analysis Big data Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Exploring outliers in crowdsourced ranking for QoE

arXiv

引用

arXiv 2017年

作者： Xu, Qianqian Yan, Ming Huang, Chendi Xiong, Jiechao Huang, Qingming Yao, Yuan Institute of Information Engineering Cas Beijing100093 Department of Computational Mathematics Michigan State University East LansingMI48824 United States BICMR-LMAM-LMEQF-LMP School of Mathematical Sciences Peking University Beijing100871 Tencent Ai Lab Shenzhen518057 University of Chinese Academy of Sciences Beijing100049 China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. Cas Beijing100190 Key Lab of Big Data Mining and Knowledge Management Cas Beijing100190 Department of Mathematics Hong Kong University of Science and Technology 100871 Hong Kong

Outlier detection is a crucial part of robust evaluation for crowd-sourceable assessment of Quality of Experience (QoE) and has attracted much attention in recent years. In this paper, we propose some simple and fast algorithms for outlier detection and robust QoE evaluation based on the nonconvex optimization principle. Several iterative procedures are designed with or without knowing the number of outliers in samples. Theoretical analysis is given to show that such procedures can reach statistically good estimates under mild conditions. Finally, experimental results with simulated and real-world crowdsourcing datasets show that the proposed algorithms could produce similar performance to Huber-LASSO approach in robust ranking, yet with nearly 8 or 90 times speed-up, without or with a prior knowledge on the sparsity size of outliers, respectively. Therefore the proposed methodology provides us a set of helpful tools for robust QoE evaluation with crowdsourcing data. Copyright © 2017, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Search result diversification based on hierarchical intents 15

Search result diversification based on hierarchical intents

引用

24th ACM International Conference on Information and knowledge Management, CIKM 2015

作者： Hu, Sha Dou, Zhicheng Wang, Xiaojie Sakai, Tetsuya Wen, Ji-Rong Beijing Key Laboratory of Big Data Management and Analysis Methods China Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Waseda University Japan

ISBN: (纸本)9781450337946

A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics. © 2015 ACM.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Rucmm at MediaEval 2015 Affective impact of movies task: Fusion of audio and visual cues

Rucmm at MediaEval 2015 Affective impact of movies task: Fus...

引用

Multimedia Benchmark Workshop, MediaEval 2015

作者： Jin, Qin Li, Xirong Cao, Haibing Huo, Yujia Liao, Shuai Yang, Gang Xu, Jieping Multimedia Computing Lab School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

This paper summarizes our efforts for the first time participation in the Violent Scene Detection subtask of the MediaEval 2015 Affective Impact of Movies Task. We build violent scene detectors using both audio and visual cues. In particular, the audio cue is represented by bag-of-audio-words with fisher vector encoding. The visual cue is exploited by extracting CNN features from video frames. The detectors are implemented using two-class linear SVM classifiers. Evaluation shows that the audio detectors and the visual detectors are comparable and complementary to each other. Among our submissions, multi-modal late fusion leads to the best performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards structured semantic embedding of multimedia 15

Towards structured semantic embedding of multimedia

引用

7th International Conference on Internet Multimedia Computing and Service, ICIMCS 2015

作者： Li, Xirong Huo, Yujia Lan, Weiyu He, Xixi Liao, Shuai Key Lab of Data Engineering and Knowledge Engineering Renmin University of China 100872 China Multimedia Computing Lab School of Information Renmin University of China 100872 China

ISBN: (纸本)9781450335287

This abstract paper sketches our research towards Struc-tured Semantic Embedding of multimedia data. Though a tag may have multiple senses with completely different visual imagery, current semantic embedding methods represent the tag by a single vector regardless of its senses. We challenge this convention, arguing the importance of adding seman-tic structures into semantic embedding. In particular, we develop Hierarchical Semantic Embedding, a simple model that exploits the WordNet hierarchy to make the semantic embedding structured to some extent. We demonstrate the viability of structured semantic embedding for tag disam-biguation and zero-shot image tagging. © 2015 ACM.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：