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

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Zhang, Chunxu Chang, Kevin Chen-Chuan Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China

Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this proximity-preserving strategy: Graph topology patterns, while preserved well into an embedding manifold by preserving proximity, may distort in the ambient embedding Euclidean space, and hence to detect them becomes difficult for machine learning models. To address the problem, we propose curvature regularization, to enforce flatness for embedding manifolds, thereby preventing the distortion. We present a novel angle-based sectional curvature, termed ABS curvature, and accordingly three kinds of curvature regularization to induce flat embedding manifolds during graph embedding. We integrate curvature regularization into five popular proximity-preserving embedding methods, and empirical results in two applications show significant improvements on a wide range of open graph datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

ARCH-COMP20 category report: Continuous and hybrid systems with nonlinear dynamics 7th

ARCH-COMP20 category report: Continuous and hybrid systems w...

引用

7th International Workshop on Applied Verification of Continuous and Hybrid Systems, ARCH 2020

作者： Geretti, Luca Dit Sandretto, Julien Alexandre Althoff, Matthias Benet, Luis Chapoutot, Alexandre Chen, Xin Collins, Pieter Forets, Marcelo Freire, Daniel Immler, Fabian Kochdumper, Niklas Sanders, David P. Schilling, Christian Department of Computer Science University of Verona Verona Italy ENSTA Paris Institut Polytechnique de Paris Palaiseau France Technische Universität München Munich Germany Mexico University of Dayton DaytonOH United States Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Universidad de la República Montevideo Uruguay Computer Science Department Carnegie Mellon University United States Mexico City Mexico Department of Mathematics Massachusetts Institute of Technology CambridgeMA United States IST Austria Klosterneuburg Austria

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. © 2020 EasyChair. All rights reserved.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

Opinion mining in e-commerce: Evaluating machine learning approaches for sentiment analysis

引用

Results in Control and Optimization 2025年 19卷

作者： Lakshmi, L. Ali, Ali B.M. Devi, K Dhana Sree Rafiq, Muhammad Shernazarov, Iskandar Othman, Nashwan Adnan Khan, M. Ijaz Department of DS & AI Faculty of Science and Technology ICFAI Foundation for Higher Education (IFHE) Hyderabad -501203 India Air Conditioning Engineering Department College of Engineering University of Warith Al-Anbiyaa Karbala Iraq Department of CSE GSOT GITAM University Hyderabad India College of Business Administration Prince Mohammad Bin Fahd University Saudi Arabia Department of Chemistry and Its Teaching Methods Tashkent State Pedagogical University Tashkent Uzbekistan Department of Computer Engineering College of Engineering Knowledge University Erbil 44001 Iraq Department of Computer Engineering Al-Kitab University Altun Kupri Iraq Department of Mechanical Engineering College of Engineering Prince Mohammad Bin Fahd University Al-Khobar Saudi Arabia Department of Mechanical Engineering Lebanese American University Beirut Lebanon

In recent years, opinion mining has played a major role in analyzing text data from various sources such as Amazon, Capterra, Facebook, Google, GetApp, and Twitter. It enables companies to actively refine their business strategies. Sentiment analysis involves interpreting and classifying customer emotions (positive, neutral, and negative) expressed in reviews using sentiment analysis techniques such as BING and AFINN. This paper presents four approaches for customer review analysis and classification: the grade-based approach, content-based approach, content-based NRC-Emotion Lexicon approach, and collaborative approach. We employ three machine learning algorithms—stacking, random forest, and LogitBoost—to evaluate the performance of these approaches. A real-time dataset from Amazon product reviews is used for training and testing the model. Empirical results reveal that the collaborative approach outperforms the grade-based, content-based, and content-based NRC-Emotion Lexicon approaches across all three machine learning algorithms. Additionally, all approaches demonstrate outstanding performance when using the boosting algorithm for customer review classification. © 2025 The Author(s)

关键词： Machine learning NRC-lexicon Product reviews Sentiment analysis Text classification

来源：评论

学校读者我要写书评

暂无评论

A Taxonomy of Online Marketing Methods

SSRN

引用

SSRN 2020年

作者： Camilleri, Mark Anthony Hajarian, Mohammad Díaz, Paloma Aedo, Ignacio Computer Science and Engineering Department Universidad Carlos III de Madrid Spain Department of Computer Engineering Basir Institute of Higher Education Abyek Iran Department of Corporate Communication Faculty of Media and Knowledge Sciences University of Malta Malta Malta

This chapter presents a systematic review of over thirty (30) types of online marketing methods. It describes different methods like email marketing, social network marketing, in-game marketing and augmented reality marketing, among other approaches. The researchers discuss that the rationale for using these online marketing strategies is to increase brand awareness, customer centric marketing and consumer loyalty. They shed light on various personalization methods including recommendation systems and user generated content in their taxonomy of online marketing terms. Hence, they explain how these online marketing methods are related to each other. The researchers contend that the boundaries between online marketing methods have not been clarified enough within the academic literature. Therefore, this chapter provides a better understanding of different online marketing methods. A review of the literature suggests that the ‘oldest’ online marketing methods including the email and the websites are still very relevant for today’s corporate communication. In conclusion, the researchers put forward their recommendations for future research about contemporary online marketing methods. © 2020, The Authors. All rights reserved.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Machine Memory Intelligence: Inspired by Human Memory Mechanisms

引用

engineering 2025年

作者： Qinghua Zheng Huan Liu Xiaoqing Zhang Caixia Yan Xiangyong Cao Tieliang Gong Yong-Jin Liu Bin Shi Zhen Peng Xiaocen Fan Ying Cai Jun Liu School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Translational Research Institute of Brain and Brain-Like Intelligence Shanghai Fourth People’s Hospital Shanghai 200434 China School of Medicine Tongji University Shanghai 200092 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science Iowa State University Ames IA 50011 USA

Large models, exemplified by ChatGPT, have reached the pinnacle of contemporary artificial intelligence (AI). However, they are plagued by three inherent drawbacks: excessive training data and computing power consumption, susceptibility to catastrophic forgetting, and a deficiency in logical reasoning capabilities within black-box models. To address these challenges, we draw insights from human memory mechanisms to introduce “machine memory,” which we define as a storage structure formed by encoding external information into a machine-representable and computable format. Centered on machine memory, we propose the brand-new machine memory intelligence (M 2 I) framework, which encompasses representation, learning, and reasoning modules and loops. We explore the key issues and recent advances in the four core aspects of M 2 I, including neural mechanisms, associative representation, continual learning, and collaborative reasoning within machine memory. M 2 I aims to liberate machine intelligence from the confines of data-centric neural networks and fundamentally break through the limitations of existing large models, driving a qualitative leap from weak to strong AI.

关键词： Machine memory intelligence Neural mechanism Associative representation Continual learning Collaborative reasoning

来源：评论

学校读者我要写书评

暂无评论

Web-based teamwork: Distributed software development course under Covid-19 15

Web-based teamwork: Distributed software development course ...

引用

15th International Conference on computer science and Education, ICCSE 2020

作者： Zhang, Rui Mestre, Pedro Serodio, Carlos Prada, Marilia Gao, Wenjuan Jilin University Key Lab of Symbolic Computation and Knowledge Engineering Chinese Ministry of Education College of Computer Science and Technology Changchun130012 China University of Minho Centro Algoritmi Guimaraes4800-058 Portugal Department of Social and Organizational Psychology Lisboa Portugal Library of Changchun University Changchun130022 China

ISBN: (纸本)9781728172675

In a increasingly globalized world, it is very important to help students to acquire the hard and soft skills needed to cope with the challenges they will face when working in such environments. However, even though students find this subject interesting and volunteer for it, it is hard, even impossible to teach college students such a distributed fashion of teamwork. In this paper, a case study is provided to illustrate the methodology and experiences of a joint course, distributed software development, of multiple universities from Asia, Europe, North and South Americas. The results show that student can get the spirit, effective communication for such web-based teamwork environment and achieve software project development. The recent developments because of the Covid-19 pandemic are the facts that now students have to cooperate remotely with each other not only across continents but also inside their own city or country. It has increased the awareness of the need for this kind of training and effectively improved the interactions between team elements in different countries and improved the students' feeling of belonging to their team. © 2020 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Incorporating Surprisingly Popular Algorithm and Euclidean Distance-based Adaptive Topology into PSO

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

AMPCliff: Quantitative definition and benchmarking of activity cliffs in antimicrobial peptides

引用

Journal of Advanced Research 2025年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Kong, Yanwen Wang, Yan Liang, Yiyang Fan, Yusi Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Software Jilin University Jilin Changchun 130012 China School of Life Sciences Jilin University Jilin Changchun 130012 China Department of Computer Science Columbia University 116th and Broadway New York City 10027 NY United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang 550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun 130103 China Changchun Wenli High School Jilin Changchun 130062 China

Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects various tasks ranging from virtual screening to lead optimization in drug development. The AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in pharmaceutical peptides with canonical amino acids. Objectives: This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. Methods: This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Results: A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the metric minimum inhibitory concentration (MIC), and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the −log(MIC) values on the benchmark dataset. Conclusion: Our findings highlight limitations in current deep learning-based representation models. To more accurately capture the properties of antimicrobial peptides (AMPs), it is ess

关键词： Activity cliff (AC) AMPCliff Antimicrobial peptide (AMP) Benchmark Minimum inhibitory concentration (MIC)

来源：评论

学校读者我要写书评

暂无评论

An AO-ADMM approach to constraining PARAFAC2 on all modes

arXiv

引用

arXiv 2021年

作者： Roald, Marie Schenker, Carla Calhoun, Vince D. Adalı, Tülay Bro, Rasmus Cohen, Jeremy E. Acar, Evrim Department of Data Science and Knowledge Discovery Simula Metropolitan Center for Digital Engineering Oslo Norway Faculty of Technology Art and Design Oslo Metropolitan University Oslo Norway Department of Psychology Georgia State University AtlantaGA United States Department of Computer Science and Electrical Engineering UMBC BaltimoreMD United States Department of Food Science University of Copenhagen Copenhagen Denmark Univ Lyon INSA-Lyon UCBL UJM-Saint Etienne CNRS Inserm CREATIS UMR 5220 U1206 VilleurbanneF-69100 France

Analyzing multi-way measurements with variations across one mode of the dataset is a challenge in various fields including data mining, neuroscience and chemometrics. For example, measurements may evolve over time or have unaligned time profiles. The PARAFAC2 model has been successfully used to analyze such data by allowing the underlying factor matrices in one mode (i.e., the evolving mode) to change across slices. The traditional approach to fit a PARAFAC2 model is to use an alternating least squares-based algorithm, which handles the constant cross-product constraint of the PARAFAC2 model by implicitly estimating the evolving factor matrices. This approach makes imposing regularization on these factor matrices challenging. There is currently no algorithm to flexibly impose such regularization with general penalty functions and hard constraints. In order to address this challenge and to avoid the implicit estimation, in this paper, we propose an algorithm for fitting PARAFAC2 based on alternating optimization with the alternating direction method of multipliers (AO-ADMM). With numerical experiments on simulated data, we show that the proposed PARAFAC2 AO-ADMM approach allows for flexible constraints, recovers the underlying patterns accurately, and is computationally efficient compared to the state-of-the-art. We also apply our model to two real-world datasets from neuroscience and chemometrics, and show that constraining the evolving mode improves the interpretability of the extracted *** Codes 15A69, 90C26 © 2021, CC BY.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Senzi: A sentiment analysis lexicon for the latinised Arabic (Arabizi) 12

Senzi: A sentiment analysis lexicon for the latinised Arabic...

引用

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Tobaili, Taha Fernandez, Miriam Alani, Harith Sharafeddine, Sanaa Hajj, Hazem Glavaš, Goran Knowledge Media Institute Open University United Kingdom Department of Computer Science and Mathematics Lebanese American University Lebanon Department of Electrical and Computer Engineering American University of Beirut Lebanon Data and Web Science Group Universität Mannheim Germany

ISBN: (纸本)9789544520557

Arabizi is an informal written form of dialectal Arabic transcribed in Latin alphanumeric characters. It has a proven popularity on chat platforms and social media, yet it suffers from a severe lack of natural language processing (NLP) resources. As such, texts written in Arabizi are often disregarded in sentiment analysis tasks for Arabic. In this paper we describe the creation of a sentiment lexicon for Arabizi that was enriched with word embeddings. The result is a new Arabizi lexicon consisting of 11.3K positive and 13.3K negative words. We evaluated this lexicon by classifying the sentiment of Arabizi tweets achieving an F1-score of 0.72. We provide a detailed error analysis to present the challenges that impact the sentiment analysis of Arabizi. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：