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

SSRN 2018年

作者： Stumme, Gerd Hotho, Andreas Berendt, Bettina Knowledge & Data Engineering Group Institute of Information Systems

Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results of Web Mining by exploiting semantic structures in the Web, and they make use o Web Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today's Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable. © 2018, The Authors. All rights reserved.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Upgraded W-net with attention gates and its application in unsupervised 3D liver segmentation

arXiv

引用

arXiv 2020年

作者： Mitta, Dhanunjaya Chatterjee, Soumick Speck, Oliver Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Germany Biomedical Magnetic Resonance Otto von Guericke University Magdeburg Germany German Center for Neurodegenerative Disease Magdeburg Germany Center for Behavioral Brain Sciences Magdeburg Germany Leibniz Institute for Neurobiology Magdeburg Germany

Segmentation of biomedical images can assist radiologists to make a better diagnosis and take decisions faster by helping in the detection of abnormalities, such as tumors. Manual or semi-automated segmentation, however, can be a time-consuming task. Most deep learning based automated segmentation methods are supervised and rely on manually segmented ground-truth. A possible solution for the problem would be an unsupervised deep learning based approach for automated segmentation, which this research work tries to address. We use a W-Net architecture and modified it, such that it can be applied to 3D volumes. In addition, to suppress noise in the segmentation we added attention gates to the skip connections. The loss for the segmentation output was calculated using soft N-Cuts and for the reconstruction output using SSIM. Conditional Random Fields were used as a post-processing step to fine-tune the results. The proposed method has shown promising results, with a dice coefficient of 0.88 for the liver segmentation compared against manual segmentation. Copyright © 2020, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Forecasting Chinese Stock Market Prices using Baidu Search Index with a Learning-Based data Collection Method

Forecasting Chinese Stock Market Prices using Baidu Search I...

引用

作者： Dong, Jichang Dai, Wei Liu, Ying Yu, Lean Wang, Jie School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management Beijing University of Chemical Technology Beijing100029 China Department of Civil and Environmental Engineering Stanford University StanfordCA94305 United States

In this study, to address search index selection and volatility problems, we propose a learning-based search index collection method that collects the search data fraction for modeling by learning the best criteria from robust statistics. Based on the fraction of collected search index from internet search engine (***) data sources, a novel model is formulated for Chinese stock market price forecasting. We empirically test our method on the two main Chinese stock market price indexes and discover that the prediction accuracy is equivalent or superior to the benchmarks from previous studies that used alternative search index collection methods or lagged data prediction models. All prediction results outstand the importance of an effective data collection method for the robustness of forecast models and demonstrate the utility of a learning-based collection method for addressing search index collection problem, leading to a significant improvement in Chinese stock market price prediction accuracy. © 2019 World Scientific Publishing Company.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Kernelized multiview subspace analysis by self-weighted learning

arXiv

引用

arXiv 2019年

作者： Wang, Huibing Wang, Yang Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University Dalian Liaoning116021 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China

—With the popularity of multimedia technology, information is always represented or transmitted from multiple views. Most of the existing algorithms are graph-based ones to learn the complex structures within multiview data but overlooked the information within data representations. Furthermore, many existing works treat multiple views discriminatively by introducing some hyperparameters, which is undesirable in practice. To this end, abundant multiview based methods have been proposed for dimension reduction. However, there are still no research to leverage the existing work into a unified framework. To address this issue, in this paper, we propose a general framework for multiview data dimension reduction, named Kernelized Multiview Subspace Analysis (KMSA). It directly handles the multi-view feature representation in the kernel space, which provides a feasible channel for direct manipulations on multiview data with different dimensions. Meanwhile, compared with those graph-based methods, KMSA can fully exploit information from multiview data with nothing to lose. Furthermore, since different views have different influences on KMSA, we propose a self-weighted strategy to treat different views discriminatively according to their contributions. A co-regularized term is proposed to promote the mutual learning from multi-views. KMSA combines self-weighted learning with the co-regularized term to learn appropriate weights for all views. We also discuss the influence of the parameters in KMSA regarding the weights of multi-views. We evaluate our proposed framework on 6 multiview datasets for classification and image retrieval. The experimental results validate the advantages of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Trajectory simplification: An experimental study and quality analysis 44th

Trajectory simplification: An experimental study and quality...

引用

44th International Conference on Very Large data Bases, VLDB 2018

作者： Zhang, Dongxiang Ding, Mengting Yang, Dingy Liu, Yi Fan, Ju Shen, Heng Tao Center for Future Media School of Computer Science and Engineering UESTC China School of Electronics and Information Shanghai Dian Ji University China The Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The ubiquitousness of GPS sensors in smart-phones, vehicles and wearable devices has enabled the collection of massive volumes of trajectory data from tracing moving objects. Consequently, an unprecedented scale of timestamped GPS data has been generated and posed an urgent demand for an effective storage mechanism for trajectory databases. The mainstream compression technique is called trajectory simplification, that finds a subsequence to approximate the original trajectory and attempts to minimize the information loss under a distance measure. Even though various simplification algorithms have been proposed in the past decades, there still lacks a thorough comparison to cover all the state-of-the-art algorithms and evaluate their quality using datasets in diversified motion patterns. Hence, it still remains a challenge for GPS data collectors to determine a proper algorithm in a concrete application. In addition, almost the entire line of previous methods uses error-based metrics to evaluate the compression quality, while ignoring their usability in supporting spatio-temporal queries on top of the reduced database. To bridge these gaps, we conduct so far the most comprehensive evaluation on trajectory simplification techniques. We compare the performance of 25 algorithms in total using five real datasets in different motion patterns. According to the experimental findings, we present useful guidance for the selection or development of effective trajectory simplification algorithms. © VLDB Endowment 21508097/18/05

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Dual Encoding for Zero-Example Video Retrieval

Dual Encoding for Zero-Example Video Retrieval

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition

作者： Jianfeng Dong Xirong Li Chaoxi Xu Shouling Ji Yuan He Gang Yang Xun Wang College of Computer and Information Engineering Zhejiang Gongshang University Key Lab of Data Engineering and Knowledge Engineering Renmin University of China AI & Media Computing Lab School of Information Renmin University of China College of Computer Science Zhejiang University Alibaba Group

ISBN: (纸本)9781728132945

This paper attacks the challenging problem of zero-example video retrieval. In such a retrieval paradigm, an end user searches for unlabeled videos by ad-hoc queries described in natural language text with no visual example provided. Given videos as sequences of frames and queries as sequences of words, an effective sequence-to-sequence cross-modal matching is required. The majority of existing methods are concept based, extracting relevant concepts from queries and videos and accordingly establishing associations between the two modalities. In contrast, this paper takes a concept-free approach, proposing a dual deep encoding network that encodes videos and queries into powerful dense representations of their own. Dual encoding is conceptually simple, practically effective and end-to-end. As experiments on three benchmarks, i.e. MSR-VTT, TRECVID 2016 and 2017 Ad-hoc Video Search show, the proposed solution establishes a new state-of-the-art for zero-example video retrieval.

关键词： Videotapes video retrieval End users end-to-end Dual coding

来源：评论

学校读者我要写书评

暂无评论

Mining Dual Emotion for Fake News Detection

arXiv

引用

arXiv 2019年

作者： Zhang, Xueyao Cao, Juan Li, Xirong Sheng, Qiang Zhong, Lei Shu, Kai Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Illinois Institute of Technology ChicagoIL United States

Emotion plays an important role in detecting fake news online. When leveraging emotional signals, the existing methods focus on exploiting the emotions of news contents that conveyed by the publishers (i.e., publisher emotion). However, fake news often evokes high-arousal or activating emotions of people, so the emotions of news comments aroused in the crowd (i.e., social emotion) should not be ignored. Furthermore, it remains to be explored whether there exists a relationship between publisher emotion and social emotion (i.e., dual emotion), and how the dual emotion appears in fake news. In this paper, we verify that dual emotion is distinctive between fake and real news and propose Dual Emotion Features to represent dual emotion and the relationship between them for fake news detection. Further, we exhibit that our proposed features can be easily plugged into existing fake news detectors as an enhancement. Extensive experiments on three real-world datasets (one in English and the others in Chinese) show that our proposed feature set: 1) outperforms the state-of-the-art task-related emotional features;2) can be well compatible with existing fake news detectors and effectively improve the performance of detecting fake news.1 2 Copyright © 2019, The Authors. All rights reserved.

关键词： Fake detection

来源：评论

学校读者我要写书评

暂无评论

Ensemble Classification Method Based on Truth Discovery

Ensemble Classification Method Based on Truth Discovery

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Yuxin Jin Ze Yang Ying He Xianyu Bao Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

Classification is a hot topic in such fields as machine learning and data mining. The traditional approach of machine learning is to find a classifier closest to the real classification function, while ensemble classification is to integrate the results of base classifiers, then make an overall prediction. Compared to using a single classifier, ensemble classification can significantly improve the generalization of the learning system in most cases. However, the existing ensemble classification methods rarely consider the weight of the classifier, and there are few methods to consider updating the weights dynamically. In this paper, we are inspired by the idea of truth discovery and propose a new ensemble classification method based on the truth discovery (named ECTD). As far as we know, we are the first to apply the idea of truth discovery in the field of ensemble learning. Experimental results demonstrate that the proposed method performs well in ensemble classification.

关键词： Reliability Machine learning Classification algorithms Task analysis Buildings Computational modeling knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

An Optimization-Based Truth Discovery Method with Claim Relation

An Optimization-Based Truth Discovery Method with Claim Rela...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Jiazhu Xia Ying He Yuxin Jin Xianyu Bao Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

With the advent of the era of big data, the information from multi-sources often conflicts due to that errors and fake information are inevitable. Therefore, how to obtain the most trustworthy or true information (i.e. truth) people need gradually becomes a troublesome problem. In order to meet this challenge, a novel hot technology named truth discovery that can infer the truth and estimate the reliability of the source without supervision has attracted more and more attention. However, most existing truth discovery methods only consider that the information is either same or different rather than the fine-grained relation between them, such as inclusion, support, mutual exclusion, etc. Actually, this situation frequently exists in real-world applications. To tackle the aforementioned issue, we propose a novel truth discovery method named OTDCR in this paper, which can handle the fine-grained relation between the information and infer the truth more effectively through modeling the relation. In addition, a novel method of processing abnormal values is applied to the preprocessing of truth discovery, which is specially designed for categorical data with the relation. Experiments in real dataset show our method is more effective than several outstanding methods.

关键词： Task analysis knowledge engineering Big data Crowdsourcing Reliability engineering Meteorology

来源：评论

学校读者我要写书评

暂无评论

Seen the villains: Detecting social engineering attacks using case-based reasoning and deep learning 27

Seen the villains: Detecting social engineering attacks usin...

引用

27th International Conference on Case-Based Reasoning Workshops, ICCBR-WS 2019

作者： Lansley, Merton Polatidis, Nikolaos Kapetanakis, Stelios Amin, Kareem Samakovitis, George Petridis, Miltos School of Computing Engineering and Mathematics University of Brighton BrightonBN2 4GJ United Kingdom German Research Center for Artificial Intelligence Smart Data and Knowledge Services Trippstadter Strasse 122 Kaiserslautern67663 Germany School of Computing & Mathematical Sciences University of Greenwich London United Kingdom Department of Computing University of Middlesex London United Kingdom

Social engineering attacks are frequent, well-known and easy-toapply attacks in the cyber domain. Historical evidence of such attacks has shown that the vast majority of malicious attempts against both physical and virtual IT systems were based or been initiated using social engineering methods. By identifying the importance of tackling efficiently cybersecurity threats and using the recent developments in machine learning, case-based reasoning and cybersecurity we propose and demonstrate a two-stage approach that detects social engineering attacks and is based on natural language processing, case-based reasoning and deep learning. Our approach can be applied in offline texts or real time environments and can identify whether a human, chatbot or offline conversation is a potential social engineering attack or not. Initially, the conversation text is parsed and checked for grammatical errors using natural language processing techniques and case-based reasoning and then deep learning is used to identify and isolate possible attacks. Our proposed method is being evaluated using both real and semi-synthetic conversation points with high accuracy results. Comparison benchmarks are also presented for comparisons in both datasets. © Copyright 2019 for this paper by its authors.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：