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

Exploring anti-community structure in networks with application to incompatibility of traditional Chinese medicine

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2017年 486卷 31-43页

作者： Zhu, Jiajing Liu, Yongguo Zhang, Yun Liu, Xiaofeng Xiao, Yonghua Wang, Shidong Wu, Xindong [a]Knowledge and Data Engineering Laboratory of Chinese Medicine School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu 610054 PR China [b]School of Basic Medical Science Beijing University of Chinese Medicine Beijing 100029 PR China [c]Dongzhimen Hospital Beijing University of Chinese Medicine Beijing 100700 PR China [d]School of Computing and Informatics University of Louisiana at Lafayette Lafayette LA 70503 USA

Community structure is one of the most important properties in networks, in which a node shares its most connections with the others in the same community. On the contrary, the anti-community structure means the nodes in the same group have few or no connections with each other. In Traditional Chinese Medicine (TCM), the incompatibility problem of herbs is a challenge to the clinical medication safety. In this paper, we propose a new anti community detection algorithm, Random non-nEighboring nOde expansioN (REON), to find anti-communities in networks, in which a new evaluation criterion, anti-modularity, is designed to measure the quality of the obtained anti-community structure. In order to establish anti-communities in REON, we expand the node set by non-neighboring node expansion and regard the node set with the highest anti-modularity as an anti-community. Inspired by the phenomenon that the node with higher degree has greater contribution to the anti-modularity, an improved algorithm called REONI is developed by expanding node set by the non-neighboring node with the maximum degree, which greatly enhances the efficiency of REON. Experiments on synthetic and real-world networks demonstrate the superiority of the proposed algorithms over the existing methods. In addition, by applying REONI to the herb network, we find that it can discover incompatible herb combinations. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Complex networks Anti-community detection Traditional Chinese medicine Incompatibility of herbs

来源：评论

学校读者我要写书评

暂无评论

HelPal: A Search System for Mobile Crowd Service

arXiv

引用

arXiv 2017年

作者： Wu, Yao Wu, Tianzhen Xiong, Ziyi Wu, Yuncheng Chen, Hong Li, Cuiping Zhang, Xiaoying Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China

Proliferation of ubiquitous mobile devices makes location based services prevalent. Mobile users are able to volunteer as providers of specific services and in the meanwhile to search these services. For example, drivers may be interested in tracking available nearby users who are willing to help with motor repair or are willing to provide travel directions or first aid. With the diffusion of mobile users, it is necessary to provide scalable means of enabling such users to connect with other nearby users so that they can help each other with specific services. Motivated by these observations, we design and implement a general location based system HelPal for mobile users to provide and enjoy instant service, which is called mobile crowd service. In this demo, we introduce a mobile crowd service system featured with several novel techniques. We sketch the system architecture and illustrate scenarios via several cases. Demonstration shows the user-friendly search interface for users to conveniently find skilled and qualified nearby service providers. Copyright © 2017, The Authors. All rights reserved.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Author Correction:data augmentation in microscopic images for material data mining

引用

npj Computational Materials 2020年第1期6卷 476-476页

作者： Boyuan Ma Xiaoyan Wei Chuni Liu Xiaojuan Ban Haiyou Huang Hao Wang Weihua Xue Stephen Wu Mingfei Gao Qing Shen Michele Mukeshimana Adnan Omer Abuassba Haokai Shen Yanjing Su Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing China Institute for Advanced Materials and Technology University of Science and Technology Beijing Beijing China School of Materials Science and Engineering University of Science and Technology Beijing Beijing China School of Materials Science and Technology Liaoning Technical University Liaoning China The Institute of Statistical Mathematics Research Organization of Information and Systems Tachikawa Tokyo Japan National Intellectual Property Administration Beijing China Faculty of Engineering Sciences University of Burundi Bujumbura Burundi Faculty of Engineering and Technology Palestine Technical University – Kadoorie Tulkarem Palestine College of Information Science and Engineering China University of Petroleum Beijing China Key Lab of Petroleum Data Mining China University of Petroleum Beijing China

The original version of this article omitted the following from the Acknowledgements:“This work was supported by Beijing Top Discipline for Artificial Intelligent Science and engineering,University of Science and Tec... 详细信息

关键词： HTML knowledge mining

来源：评论

学校读者我要写书评

暂无评论

How China Deals with Big data

引用

Annals of data Science 2017年第4期4卷 433-440页

作者： Shi, Yong Shan, Zhiguang Li, Jianping Fang, Yufei 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 Beijing China Informatization Research Department State Information Center Beijing100045 China Institute of Policy and Management Chinese Academy of Sciences Beijing100190 China School of Computer and Communication Engineering University of Science and Technology Beijing100083 China Informatization Research Department State Information Center Beijing100045 China

On September 5, 2015, the State Council of Chinese Government, China’s cabinet formally announced its Action Framework for Promoting Big data (***, 2015). This is the milestone for China to catch up the global wave of big data. Since 2012 big data became a hot issue for scientific communities as well as the governments of many countries (Lazer et al. in Science 343:1203–1205, 2014;Einav et al. in Science 345:715, 2014;Cate in Science 346:818, 2014;Khoury and Ioannidis in Science 346:1054–1055, 2014). At the 2013 G8 Summit, the leaders of Canada, France, Germany, Italy, Japan, Russia, U.S.A. and United Kingdom agreed on an "open government plan" (***/government/publications/open-data-charter/g8-open-data-charter-and-technical-annex, 2013). China’s framework, however, mainly emphasizes the integration of all trans-departmental data and establishes a number of government-driven national big data platforms so as to provide big data services to research, public and enterprises. The framework not only demonstrates a strong commitment of the Chinese government on big data, but also covers a wide range of governmental branches, enterprises and institutions far more than that of other countries. In addition, the framework shows an interpretation of big data that differs from other countries. If its objective is achieved, China would become a strong "big data country". © 2017, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Examining scientific writing styles from the perspective of linguistic complexity

arXiv

引用

arXiv 2018年

作者： Lu, Chao Bu, Yi Wang, Jie Ding, Ying Torvik, Vetle Schnaars, Matthew Zhang, Chengzhi School of Economics and Management Nanjing University of Science and Technology Nanjing Jiangsu China School of Informatics Computing and Engineering Indiana University BloomingtonIN United States Center for Complex Networks and Systems Research School of Informatics Computing and Engineering Indiana University BloomingtonIN United States School of Information Management Nanjing University Nanjing Jiangsu China School of Information Management Wuhan University Wuhan Hubei China School of Information Sciences University of Illinois UrbanaIL United States Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing Jiangsu China

Publishing articles in high-impact English journals is difficult for scholars around the world, especially for non-native English-speaking scholars (NNESs), most of whom struggle with proficiency in English. In order to uncover the differences in English scientific writing between native English-speaking scholars (NESs) and NNESs, we collected a large-scale data set containing more than 150,000 full-text articles published in PLoS between 2006 and 2015. We divided these articles into three groups according to the ethnic backgrounds of the first and corresponding authors, obtained by Ethnea, and examined the scientific writing styles in English from a two-fold perspective of linguistic complexity: (1) syntactic complexity, including measurements of sentence length and sentence complexity;and (2) lexical complexity, including measurements of lexical diversity, lexical density, and lexical sophistication. The observations suggest marginal differences between groups in syntactical and lexical complexity. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CSMCCVA:Framework of cross-modal semantic mapping based on cognitive computing of visual and auditory sensations

引用

High Technology Letters 2016年第1期22卷 90-98页

作者：刘扬 Zheng Fengbin Zuo Xianyu Laboratory of Spatial Information Processing Henan University College of Computer Science and Information Engineering Henan University College of Environment and Planning Henan University Institute of Data and Knowledge Engineering Henan University

Cross-modal semantic mapping and cross-media retrieval are key problems of the multimedia search *** study analyzes the hierarchy,the functionality,and the structure in the visual and auditory sensations of cognitive system,and establishes a brain-like cross-modal semantic mapping framework based on cognitive computing of visual and auditory *** mechanism of visual-auditory multisensory integration,selective attention in thalamo-cortical,emotional control in limbic system and the memory-enhancing in hippocampal were considered in the ***,the algorithms of cross-modal semantic mapping were *** results show that the framework can be effectively applied to the cross-modal semantic mapping,and also provides an important significance for brain-like computing of non-von Neumann structure.

关键词： multimedia neural cognitive computing （MNCC） brain-like computing cross-modal semantic mapping （CSM） selective attention limbic system multisensory integration memory-enhancing mechanism

来源：评论

学校读者我要写书评

暂无评论

A generalized concept-cognitive learning: A machine learning viewpoint

arXiv

引用

arXiv 2018年

作者： Mi, Yunlong Shi, Yong Li, Jinhai School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha NE68182 United States Faculty of Science Kunming University of Science and Technology Kunming650500 China

Concept-cognitive learning (CCL) is a hot topic in recent years, and it has attracted much attention from the communities of formal concept analysis, granular computing and cognitive computing. However, the relationship among cognitive computing (CC), concept-cognitive computing (CCC), CCL and concept-cognitive learning model (CCLM) is not clearly described. To this end, we first explain the relationship of CC, CCC, CCL and CCLM. Then, we propose a generalized concept-cognitive learning (GCCL) from the point of view of machine learning. Finally, experiments on some data sets are conducted to verify the feasibility of concept formation and concept-cognitive process of GCCL. Copyright © 2018, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

RJMIM: A new feature selection method based on joint mutual information

引用

Revista de la Facultad de Ingenieria 2016年第4期31卷 59-69页

作者： Peng, Liwen Liu, YongGuo Knowledge and Data Engineering Laboratory of Chinese Medicine School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu610054 China

Feature selection based on information theory plays an important role in classification algorithm due to its computational efficiency and independent from classification method. It is widely used in many application areas like data mining, bioinformatics and machine learning. But drawbacks of these methods are the neglect of the feature interaction and overestimation of features significance due to the limitations of goal functions criterion. To address this problem, we proposed a new feature goal function RJMIM. The method employed joint mutual information and information interaction, which alleviates the shortcomings of overestimation of the feature significance as demonstrated both theoretically and experimentally. The experiments conducted to verify the performance of the proposed method, it compared with four well-known feature selection methods use three publically available datasets from UCI. The average classification accuracy and C4.5 classifier is used to assess the effectiveness of RJMIM method.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Weighted neural bag-of-n-grams model: New baselines for text classification 26

Weighted neural bag-of-n-grams model: New baselines for text...

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Li, Bofang Zhao, Zhe Liu, Tao Wang, Puwei Du, Xiaoyong School of Information Renmin University of China Key laboratory of Data Engineering and Knowledge Engineering MOE China

ISBN: (纸本)9784879747020

NBSVM is one of the most popular methods for text classification and has been widely used as baselines for various text representation approaches. It uses Naive Bayes (NB) feature to weight sparse bag-of-n-grams representation. N-gram captures word order in short context and NB feature assigns more weights to those important words. However, NBSVM suffers from sparsity problem and is reported to be exceeded by newly proposed distributed (dense) text representations learned by neural networks. In this paper, we transfer the n-grams and NB weighting to neural models. We train n-gram embeddings and use NB weighting to guide the neural models to focus on important words. In fact, our methods can be viewed as distributed (dense) counterparts of sparse bag-of-n-grams in NBSVM. We discover that n-grams and NB weighting are also effective in distributed representations. As a result, our models achieve new strong baselines on 9 text classification datasets, e.g. on IMDB dataset, we reach performance of 93.5% accuracy, which exceeds previous state-of-the-art results obtained by deep neural models. All source codes are publicly available at https://***/zhezhaoa/neural-BOW-toolkit. © 1963-2018 ACL.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Utility-based anonymisation for dataset with multiple sensitive attributes

Utility-based anonymisation for dataset with multiple sensit...

引用

作者： Wang, Lixia Zhu, Qing Key Laboratory for Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing100872 China

Privacy-preserving data publication problem has attracted more and more attentions in recent years. A lot of related research works have been done towards dataset with single sensitive attribute. However, usually, original dataset contains more than one sensitive attribute. In this paper, we apply k-anonymity principle to solve the data publication problem for dataset with multiple sensitive attributes. We first cluster sensitive values based on a utility matrix. Then, we use a greedy strategy to partition tuples into equivalence classes. Our method can guarantee that the size of equivalence class is k except the last one, which reduces information loss. Also, we can guarantee the diversity of sensitive value in an equivalence class, which can protect privacy against the homogeneity attack. Experiments on a real dataset show that our method performs well on information loss, which indicates that we can guarantee data utility while protecting personal privacy. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：