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

IEEE Conference on Dependable and Secure Computing

作者： Jiasheng Li Zijian Zhang Meng Li Beijing Engineering Research Center of Massive Language Information Beijing Institute of Technology Beijing China School of Computer Science University of Auckland Aukland New Zealand Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei University of Technology Anhui China

Lottery is a game with many people's dreams. But corruptions of lottery centers make the lottery unfair. To address this unfair issue, fair lottery schemes have been studied for several years. In these schemes, delay functions or aggregation protocols can be used to generate the winning numbers fairly. However, to the best of our knowledge, none of the existing schemes can achieve the winning number generated randomly, while the randomness can be verified fairly. In this article, we first propose a [B]lockchain based sm[a]rt co[n]tract for [F]air and [E]fficient [L]ottery (BanFEL) scheme. We further present a winning number random generation smart contract, by which players submit the purchased numbers and the non-tampering property is protected. Security analysis and experiments show that the fairness of BanFEL is protected better than the existing works. Meanwhile, the verification cost of this scheme are at least 0.03s lower than the traditional Grumbach's scheme between 1000 and 10000 players.

关键词： Blockchain Smart contracts Security Mathematical model Privacy Information processing

来源：评论

学校读者我要写书评

暂无评论

Semantics, Web and Mining 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Markus Ackermann Bettina Berendt Marko Grobelnik Andreas Hotho Dunja Mladenič Giovanni Semeraro Myra Spiliopoulou Gerd Stumme Vojtěch Svátek Maarten Someren

ISBN: (数字)9783540476986

ISBN: (纸本)9783540476979

Finding knowledge – or meaning – in data is the goal of every knowledge d- covery e?ort. Subsequent goals and questions regarding this knowledge di?er amongknowledgediscovery(KD) projectsandapproaches. Onecentralquestion is whether and to what extent the meaning extracted from the data is expressed in a formal way that allows not only humans but also machines to understand and re-use it, i. e. , whether the semantics are formal semantics. Conversely, the input to KD processes di?ers between KD projects and approaches. One central questioniswhetherthebackgroundknowledge,businessunderstanding,etc. that the analyst employs to improve the results of KD is a set of natural-language statements, a theory in a formal language, or somewhere in between. Also, the data that are being mined can be more or less structured and/or accompanied by formal semantics. These questions must be asked in every KD e?ort. Nowhere may they be more pertinent, however, than in KD from Web data (“Web mining”). Thisis due especially to the vast amounts and heterogeneity of data and ba- ground knowledge available for Web mining (content, link structure, and - age), and to the re-use of background knowledge and KD results over the Web as a global knowledge repository and activity space. In addition, the (Sem- tic) Web can serve as a publishing space for the results of knowledge discovery from other resources, especially if the whole process is underpinned by common ontologies.

关键词： Artificial Intelligence Computer Communication Networks database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Computers and Society

来源：评论

学校读者我要写书评

暂无评论

Towards Ordinal data Science

arXiv

引用

arXiv 2023年

作者： Stumme, Gerd Dürrschnabel, Dominik Hanika, Tom Knowledge & Data Engineering Group Research Center for Information System Design Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Order is one of the main instruments to measure data. In this paper, we will therefore discuss difthe relationship between objects in (empirical) data. ferent means for measuring and ‘calculating’ with However, compared to methods that use numerical ordinal structures — a specific class of directed properties of objects, the amount of ordinal meth- graphs — and show how to infer knowledge from ods developed is rather small. One reason for this is them. Our aim is to establish Ordinal data Science the limited availability of computational resources as a fundamentally new research agenda. Besides in the last century that would have been required cross-fertilization with other cornerstone machine for ordinal computations. Another reason — partic- learning and knowledge representation methods, a ularly important for this line of research — is that broad range of disciplines will benefit from this en-order-based methods are often seen as too mathe- deavor, including, psychology, sociology, economics, matically rigorous for applying them to real-world web science, knowledge engineering, *** Codes 03G10, 06A15, 68T27, 68T30 Copyright © 2023, The Authors. All rights reserved.

关键词： data Science

来源：评论

学校读者我要写书评

暂无评论

SP3: Enhancing Structured Pruning via PCA Projection

arXiv

引用

arXiv 2023年

作者： Hu, Yuxuan Zhang, Jing Zhao, Zhe Zhao, Chen Chen, Xiaodong Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China Tencent AI Lab Tencent Beijing China School of Computer Science and Technology Xi'an Jiaotong University Xi'An China

Structured pruning is a widely used technique for reducing the size of pre-trained language models (PLMs), but current methods often overlook the potential of compressing the hidden dimension (d) in PLMs, a dimension critical to model size and efficiency. This paper introduces a novel structured pruning approach, Structured Pruning with PCA Projection (SP3), targeting the effective reduction of d by projecting features into a space defined by principal components before masking. Extensive experiments on benchmarks (GLUE and SQuAD) show that SP3 can reduce d by 70%, compress 94% of the BERTbase model, and maintain over 96% accuracy and outperform other methods that compress d by 6% in accuracy at the same compression ratio. SP3 has also proven effective with other models, including OPT and Llama. Our data and code are available at ours repo. © 2023, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Promoting Business Analytics and Quantitative Management of Technology: Preface for ITQM 2016

引用

Procedia Computer Science 2016年第0期91卷 1-8页

作者： Lee, Heeseok Shi, Yong Lee, Jongwon Cordova, Felisa Dzitac, Ioan Kou, Gang Li, Jaiping College of Business Korea Advanced Institute Science and Technology Dongdaemum-gu Seoul130-722 Korea Republic of Research Center on Fictitiotus Economy and Data Science 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 OmahaNE68182 United States School of Business Administration Hoseo University Asan-si Chungcheongnam-do336-795 Korea Republic of Faculty of Engineering and Business University Finis Terrae Pedro de Valdivia 1509. Providencia Santiago Chile Universitatea Agora Agora University Piata Tineretului 8 Oradea410526 Romania School of Business Administration Southwestern University of Finance and Economics Chengdu Sichuan61130 China Institute of Policy and Management Chinese Academy of Sciences Beijing100190 China

来源：评论

学校读者我要写书评

暂无评论

MDPL-net: Multi-layer Dictionary Learning Network with Added Skip Dense Connections

MDPL-net: Multi-layer Dictionary Learning Network with Added...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Lin Wu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Dictionary learning (DL) is powerful for representation learning, while it fails to capture the deep hierarchical information hidden in data. In this paper, we propose a new generalized end-to-end mulita-layer representation learning architecture referred to as Multi-layer Dictionary Pair Learning Network (MDPL-net) for the deep sparse and hierarchical representation of images. To enable MDPL-net to conduct accurate classification, MDPL-net clearly integrates the skip connection end-to-end network and multi-layer deep sparse dictionary learning into a unified architecture. The representation learning module has several hidden DL blocks, where each hidden DL block has a dictionary pair learning (DPL) layer, a batch-norm layer and an activation function layer, and the DL blocks are connected in a feed-forward manner. To further improve the information flow and maintain the privileged features between different DL blocks, a novel skip dense connectivity pattern is deployed between hidden DL blocks, which can obtain more stable and discriminative features. The DPL layer jointly formulates the discriminative synthesis dictionary and analysis dictionary by minimizing reconstruction error within each batch over the feature maps from front layers. Extensive results on benchmark databases demonstrate the effectiveness of MDPL-net for discriminative representation and robust image classification.

关键词： Dictionaries databases Conferences Machine learning data mining Image reconstruction Image classification

来源：评论

学校读者我要写书评

暂无评论

Multi-view SVM Classification with Feature Selection

引用

Procedia Computer Science 2019年 162卷 405-412页

作者： Yuting Niu Yuan Shang Yingjie Tian School of Information Engineering Zhengzhou University Zhengzhou 450001 China Smart City Institute Zhengzhou University Zhengzhou 450001 China Supercomputer Center Smart City Institute Zhengzhou University Henan 450001 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge management Beijing 100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China

With the rapid development of data mining technology, multi-view learning (MVL) has become a new research field, which has attracted wide attention of scholars at home and abroad. Multi-view learning is to combine multiple view data of the same entity for data classification, thereby improving learning performance. Previous multi-view research methods mainly concentrate on the relationship between different data views for classification problems. However, when the data is in high dimensions, it is necessary to perform feature selection in the multi-view data classification process. In this paper, we proposed a Multi-view Support Vector Machine Classification with Feature Selection (MSVMCFS) algorithm, which can not only classify multi-view data, but also select features for each view data in the process of classification. In the model, feature selection is performed by the l 1 norm sparsity regularization, and consistency and complementarity between the two views are maintained. To achieve the optimization goal, we adopt linear programming to solve the model. The experimental results on 30 binary datasets demonstrate the validity of the model.

关键词： multi-view learning classification feature selection sparsity regularization linear programming

来源：评论

学校读者我要写书评

暂无评论

Application of Clustering Methods to Health Insurance Fraud Detection

Application of Clustering Methods to Health Insurance Fraud ...

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Yi Peng Gang Kou Alan Sabatka Zhengxin Chen Deepak Khazanchi Yong Shi Peter Kiewit Institute of Information Science Technology & Engineering University of Nebraska Omaha Omaha NE USA Mutual of Omaha Omaha NE USA Chinese Academy of Sciences Research Center on Data Technology & Knowledge Economy Chinese Academy of Sciences Beijing China

Health insurance fraud detection is an important and challenging task. Traditionally, insurance companies use human inspections and heuristic rules to detect fraud. As the size of databases increases, the traditional approaches may miss a great portion of fraud for two main reasons. First, it is impossible to detect all health care fraud by manual inspection over large databases. Second, new types of health care fraud emerge constantly. SQL operations based on heuristic rules cannot identify those new emerging fraud schemes. Such a situation demands more sophisticated analytical methods and techniques that are capable of detecting fraud activities from large databases. The goal of this paper is to understand and detect suspicious health care frauds from large databases using clustering technique. Specifically, this paper applies two clustering methods, SAS EM and CLUTO, to a large real-life health insurance dataset and compares the performances of these two methods

关键词： Clustering methods Insurance Medical services Inspection Synthetic aperture sonar Humans data mining Spatial databases Cities and towns Input variables

来源：评论

学校读者我要写书评

暂无评论

Online Robust Lagrangian Support Vector Machine against Adversarial Attack

引用

Procedia Computer Science 2018年 139卷 173-181页

作者： Yue Ma Yiwei He Yingjie Tian School of Mathematical Sciences University of Chinese Academy of Sciences Beijing 100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100049 China Key Laboratory of Big Data Mining and Knowledge management Beijing 100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China

In adversarial environment such as intrusion detection and spam filtering, the adversary-intruder or spam advertiser may attempt to produce contaminate training instance and manipulate the learning of classifier. In order to keep good classification performance, many robuster learning methods have been proposed to deal with the adversarial attack. Support Vector Machines(SVMs) is a kind of successful approach in the adversarial classification tasks and the investigation of robust SVMs is very popular. However, in many real application, the data including stain instance is coming dynamically. Batch learning which needs retraining when encountering new samples, will consume more computing resources. In this paper, we propose a robust Lagrangian support vector machine (RLSVM) with modified kernel matrix and explore the online learning algorithm on it. The experimental results show the robustness of RLSVM against label noise produced by adversaries under the online adversarial environment.

关键词： adversarial attack poison attack label noise online learning Lagrangian SVM

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Keyword Extraction Method Based on Chinese Patent Clustering

Unsupervised Keyword Extraction Method Based on Chinese Pate...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Yuxin Xie Xuegang Hu Yuhong Zhang Shi Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Intelligent Connected Vehicle Research Institute (JAC Technical Center) Anhui Jianghuai Automobile Group Corp.Ltd Hefei China

Recently, patent data analysis has attracted a lot of attention, and patent keyword extraction is a hot problem. Most existing methods for patent keyword extraction are based on the frequency of words without semantic information. In this paper, we propose an Unsupervised Keyword Extraction Method (UKEM) based on Chinese patent clustering. More specifically, we use a Skip-gram model to train word embeddings based on a Chinese patent corpus. Then each patent is represented as a vector called patent vector. These patent vectors are clustered to obtain several cluster centroids. Next, the distance between each word vector in patent abstract and cluster centroid is computed to indicate the semantic importance of this word. The experimental results on several Chinese patent datasets show that the performance of our proposed method is better than several competitive methods.

关键词： Patents Semantics data mining knowledge engineering Neural networks Big data Computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：