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

2017 International Symposium on Computer Science and Artificial Intelligence（ISCSAI 2017）

作者： Li Xin Sun Guozi Li Huakang Jiangsu Key Lab of Big Data and Security and Intelligent Processing Nanjing University of Posts and Telecommunications Collaborative Innovation Center for Economics crime investigation and prevention technology State Key Laboratory of Mathematical Engineering and Advanced Computing

With the development of information technology, the application of big data in financial aspects becomes more and more deepening. However, in the aspect of bank loans, the accuracy of traditional user loan risk prediction models, such as KNN, Bayesian, are not benefit from the data *** paper proposes to use DNN algorithm to forecast the risk of user loan based on the difficulties of current overdue prediction and the excellent learning ability of DNN. This article uses user basic information, bank records, user browsing behavior, credit card billing records, and loan time information to evaluate whether users are delinquent. Firstly, this paper record bank records according to the transaction type, respectively, to generate income and spending data. Secondly, to sum the user browsing behavior also, and to record the average of credit card bill. In addition, in order to reduce the effect of eigenvalue size on the result, all characteristics are standardized. Finally, users who lack user information are discarded and the above fields are spliced. The spliced fields are the basic input for DNN. From the experimental results, DNN algorithm inc rease over 6% prediction than kNN, Bayes algorithm.

关键词： Overdue Prediction Bank Loans DNN

来源：评论

学校读者我要写书评

暂无评论

Clickthrough Refinement for Improved Graph Ranking

Clickthrough Refinement for Improved Graph Ranking

引用

International Joint Conference on Neural Networks

作者： Yu He Jun Wu Haishuai Wang Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Centre for Quantum Computation & Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney

ISBN: (纸本)9781509061839

Graph ranking is a promising technique for image retrieval, but its effectiveness is limited by the so-called semantic gap. To mitigate this gap, clickthroughs, which are helpful to perceive the visual content of images, are adopted by graph ranking models recently. However, few existing models take both sparseness and noisiness of clickthroughs into account, which are important in refining the clickthrough-based search results. In this paper, we propose a novel solution to clickthrough refinement that consists of two key components. The first one is to prune the noisy clickthroughs by a neighbor voting strategy, and the second one is to enrich the incomplete clickthroughs by a Tri-CF (collaborative filtering) algorithm. Furthermore, we devise four solutions to affinity matrices fusion in order to leverage the clickthroughs and visual features within a unified graph ranking model. Our extensive experiments for clickthrough prediction and image retrieval validate the effectiveness of the proposed techniques in comparison to state-of-the-art approaches.

关键词： image retrieval Line graph Refining

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Internet Traffic Analysis Using Community Detection and Apache Spark

Internet Traffic Analysis Using Community Detection and Apac...

引用

第九届网络分布式计算与知识发现国际会议( 2017 International Conference on Cyber-enabled distributed computing and knowledge discovery)

作者： Jiake Ni Weitao Weng Jiayu Chen Kai Lei Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology & Applications School of Electronic and Computer Engineering(SECE)Peking University SHENZHEN 518055P.R.CHINA

With the rapid development of Internet,Internet traffic and end hosts continue to grow in *** behavior analysis for a large-scale network is becoming more and more *** address these challenges,this paper proposes an Internet traffic analysis approach based on community detection to discover community consisted of end hosts with similar traffic behavior in a large campus ***,we use only the IP-to-IP information without packet payloads to model the similarity of end hosts in campus *** the similarity graph which represent the social behavior similarity of all end hosts is ***,we leverage label Propagation algorithm to discover end hosts community on the similarity *** satisfy demands for the scalable analysis of evergrowing Internet traffic data,a Spark-based Internet traffic analysis system is developed,including implementing the above *** experimental results based on real campus network traffic show the benefits of the proposed approach in analyzing traffic behavior of a large-scale network on host community level and detecting potential anomalous traffic *** proposed approach reduces the complexity of analyzing the traffic behavior of a large network compare with analyzing individual *** addition,the experimental results also demonstrate the Spark-based Internet traffic analysis system can analyze Internet traffic efficiently.

关键词： Internet traffic analysis community detection Apache Spark data mining

来源：评论

学校读者我要写书评

暂无评论

Multi-label inductive matrix completion for joint MGMT and IDH1 status prediction for glioma patients 1

引用

20th International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2017

作者： Chen, Lei Zhang, Han Thung, Kim-Han Liu, Luyan Lu, Junfeng Wu, Jinsong Wang, Qian Shen, Dinggang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Department of Radiology and BRIC University of North Carolina Chapel Hill United States School of Biomedical Engineering Med-X Research Institute Shanghai Jiao Tong University Shanghai China Department of Neurosurgery Huashan Hospital Fudan University Shanghai China Shanghai Key Lab of Medical Image Computing and Computer Assisted Intervention Shanghai China

ISBN: (数字)9783319661858

ISBN: (纸本)9783319661841

MGMT promoter methylation and IDH1 mutation in high-grade gliomas (HGG) have proven to be the two important molecular indicators associated with better prognosis. Traditionally, the statuses of MGMT and IDH1 are obtained via surgical biopsy, which is laborious, invasive and time-consuming. Accurate presurgical prediction of their statuses based on preoperative imaging data is of great clinical value towards better treatment plan. In this paper, we propose a novel Multi-label Inductive Matrix Completion (MIMC) model, highlighted by the online inductive learning strategy, to jointly predict both MGMT and IDH1 statuses. Our MIMC model not only uses the training subjects with possibly missing MGMT/IDH1 labels, but also leverages the unlabeled testing subjects as a supplement to the limited training dataset. More importantly, we learn inductive labels, instead of directly using transductive labels, as the prediction results for the testing subjects, to alleviate the overfitting issue in small-sample-size studies. Furthermore, we design an optimization algorithm with guaranteed convergence based on the block coordinate descent method to solve the multivariate non-smooth MIMC model. Finally, by using a precious single-center multi-modality presurgical brain imaging and genetic dataset of primary HGG, we demonstrate that our method can produce accurate prediction results, outperforming the previous widely-used single- or multi-task machine learning methods. This study shows the promise of utilizing imaging-derived brain connectome phenotypes for prognosis of HGG in a non-invasive manner. © Springer International Publishing AG 2017.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A collaborative join scheme on a MIC-based heterogeneous platform

A collaborative join scheme on a MIC-based heterogeneous pla...

引用

Lecture Notes in Computer Science

作者： Zhou, Kailai Sun, Hui Chen, Hong Wu, Tianzhen Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing China School of Computer and Information Southwest Forestry University Kunming China

ISBN: (纸本)9783319458168

Join is one of the most important operations in data analytics systems. Prior works focus mainly on join optimization using GPUs, but little is known about performance impact on the MICs. In order to investigate potential benefits of the use of MIC accelerators in improving performance of join operation, in this paper we design a join scheme with a CPU and MICs working collaboratively. This scheme includes task partitioning, a data transfer mode, join algorithm design. Experimental results show that our collective join scheme is effective for a heterogeneous platform with two Xeon Phi cards, and can improve performance by up to 30 % over the CPU-only platform. © Springer International Publishing Switzerland 2016.

关键词： data transfer

来源：评论

学校读者我要写书评

暂无评论

Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise

arXiv

引用

arXiv 2017年

作者： Qian, Chao Bian, Chao Jiang, Wu Tang, Ke Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Hefei230027 China Shenzhen Key Lab of Computational Intelligence Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

In many real-world optimization problems, the objective function evaluation is subject to noise, and we cannot obtain the exact objective value. Evolutionary algorithms (EAs), a type of general-purpose randomized optimization algorithm, have been shown to be able to solve noisy optimization problems well. However, previous theoretical analyses of EAs mainly focused on noise-free optimization, which makes the theoretical understanding largely insufficient for the noisy case. Meanwhile, the few existing theoretical studies under noise often considered the one-bit noise model, which flips a randomly chosen bit of a solution before evaluation;while in many realistic applications, several bits of a solution can be changed simultaneously. In this paper, we study a natural extension of one-bit noise, the bit-wise noise model, which independently flips each bit of a solution with some probability. We analyze the running time of the (1+1)-EA solving OneMax and LeadingOnes under bit-wise noise for the first time, and derive the ranges of the noise level for polynomial and super-polynomial running time bounds. The analysis on LeadingOnes under bit-wise noise can be easily transferred to one-bit noise, and improves the previously known results. Since our analysis discloses that the (1+1)-EA can be efficient only under low noise levels, we also study whether the sampling strategy can bring robustness to noise. We prove that using sampling can significantly increase the largest noise level allowing a polynomial running time, that is, sampling is robust to noise. Copyright © 2017, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Path ω-automaton

引用

Journal of Information Hiding and Multimedia Signal Processing 2017年第3期8卷 640-648页

作者： Jiang, Hua Zou, Fumin Lin, Rongde Li, Lingxiang Key Lab of Granular Computing Minnan Normal University ZhangzhouFujian China Beidou Navigation and Smart Traffic Innovation Center of Fujian Province FuzhouFujian China School of Mathematical Science Huaqiao university QuanzhouFujian China Fujian Provincial Key Laboratory of Big Data Mining and Applications FuzhouFujian China School of Electronics and Information Engineering Hunan University of Science and Engineering YongzhouHunan China

Automata theory is an important branch of theoretical computer science. ω-automaton is an important part of automata theory. The judgment standard for the equivalence of two automata is the equivalence of their acceptance language. Acceptance conditions for automata are expressed with state set. This paper tries to use path to express acceptance conditions for ω-automaton that is convenient for judging the automatons equivalence property and transforming between different types of automata. With the help of Path ω-automaton, Muller automaton is transformed into Büchi automaton. Compared with the existing algorithm, the state scale of Büchi automaton has been reduced and the problem of state space explosion has been relieved. The research findings in this paper contribute to enrich the existing ω-automaton theory and provide a new idea for ω-automaton theory and application research. © 2017.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：