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

Learning from context： a mutual reinforcement model for Chinese microblog opinion retrieval

Frontiers of Computer science 2018年第4期12卷 714-724页

作者： Jingjing WEI Xiangwen LIAO Houdong ZHENG Guolong CHEN Xueqi CHENG College of Mathematics and Computer Science Fuzhou University Fuzhou 350108 China College of Electronics and Information Science Fujian Jiangxia University Fuzhou 350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligence Processing Fuzhou University Fuzhou 350108 China Institute of Computing Technology Chinese Academic of Sciences Beijing 100190 China

This study addresses the problem of Chinese microblog opinion retrieval, which aims to retrieve opinionated Chinese microblog posts relevant to a target specified by a user query. Existing studies have shown that lexicon-based approaches employed online public sentiment resources to rank sentiment words relying on the document features. However, this approach could not be effectively applied to mi- croblogs that have typical user-generated content with valu- able contextual information：＂user-user＂ interpersonal interactions and ＂user-post/comment＂ intrapersonal interactions. This contextual information is very helpful in estimating the strength of sentiment words more accurately. In this study, we integrate the social contextual relationships among users, posts/comments, and sentiment words into a mutual reinforcement model and propose a unified three-layer heterogeneous graph, on which a random walk sentiment word weighting algorithm is presented to measure the strength of opinion of the sentiment words. Furthermore, the weights of sentiment words are incorporated into a lexicon-based model for Chinese microblog opinion retrieval. Comparative experiments are conducted on a Chinese microblog corpus, and the results show that our proposed mutual reinforcement model achieves significant improvement over previous methods.

关键词： opinion retrieval sentiment words lexiconweighting mutual reinforcement model

来源：评论

学校读者我要写书评

暂无评论

A novel decision tree for depression recognition in speech

arXiv

引用

arXiv 2020年

作者： Liu, Zhenyu Wang, Dongyu Zhang, Lan Hu, Bin Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Joint Research Center for Cognitive Neurosensor Technology of Lanzhou University Institute of Semiconductors Chinese Academy of Sciences Beijing China Lanzhou University Second Hospital Lanzhou China

Depression is a common mental disorder worldwide which causes a range of serious outcomes. The diagnosis of depression relies on patient-reported scales and psychiatrist’s interview which may lead to subjective bias. In recent years, more and more researchers are devoted to depression recognition in speech, which may be an effective and objective indicator. This study proposes a new speech segment fusion method based on decision tree to improve the depression recognition accuracy and conducts a validation on a sample of 52 subjects (23 depressed patients and 29 healthy controls). The recognition accuracy are 75.8% and 68.5% for male and female respectively on gender-dependent models. It can be concluded from the data that the proposed decision tree model can improve the depression classification performance. Copyright © 2020, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A quantum-inspired classical algorithm for separable non-negative matrix factorization

arXiv

引用

arXiv 2019年

作者： Chen, Zhihuai Li, Yinan Sun, Xiaoming Yuan, Pei Zhang, Jialin CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Centrum Wiskunde & Informatica and QuSoft Science Park 123 Amsterdam1098XG Netherlands

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, separability assumption is introduced which assumes all data points are in a conical hull. This assumption makes NMF tractable and is widely used in text analysis and image processing, but still impractical for huge-scale datasets. In this paper, inspired by recent development on dequantizing techniques, we propose a new classical algorithm for separable NMF problem. Our new algorithm runs in polynomial time in the rank and logarithmic in the size of input matrices, which achieves an exponential speedup in the low-rank setting. Copyright © 2019, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Overview of AI and Communication for 6G network: Fundamentals, Challenges, and Future Research Opportunities

arXiv

引用

arXiv 2024年

作者： Cui, Qimei You, Xiaohu Ni, Wei Nan, Guoshun Zhang, Xuefei Zhang, Jianhua Lyu, Xinchen Ai, Ming Tao, Xiaofeng Feng, Zhiyong Zhang, Ping Wu, Qingqing Tao, Meixia Huang, Yongming Huang, Chongwen Liu, Guangyi Peng, Chenghui Pan, Zhiwen Sun, Tao Niyato, Dusit Chen, Tao Khan, Muhammad Khurram Jamalipour, Abbas Guizani, Mohsen Yuen, Chau National Engineering Research Center of Mobile Network Technologies Beijing University of Posts and Telecommunications Beijing100876 China Department of Broadband Communication Peng Cheng Laboratory Shenzhen518055 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Fudan University Shanghai200433 China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China CICT Mobile Communication Technology Co. Ltd. Beijing100020 China Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Shanghai Jiao Tong University Shanghai200240 China College of Information Science and Electronic Engineering Zhejiang University Hangzhou310058 China China Mobile Research Institute Beijing100053 China Huawei Technologies Shanghai201206 China College of Computing and Data Science Nanyang Technological University Singapore117583 Singapore VTT Technical Research Centre of Finland Ltd. EspooFI-02044 VTT Finland Center of Excellence in Information Assurance King Saud University Riyadh11362 Saudi Arabia School of Electrical and Information Engineering University of Sydney NSW2006 Australia Abu Dhabi United Arab Emirates School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore

With the growing demand for seamless connectivity and intelligent communication, the integration of artificial intelligence (AI) and sixth-generation (6G) communication networks has emerged as a transformative paradigm. By embedding AI capabilities across various network layers, this integration enables optimized resource allocation, improved efficiency, and enhanced system robust performance, particularly in intricate and dynamic environments. This paper presents a comprehensive overview of AI and communication for 6G networks, with a focus on emphasizing their foundational principles, inherent challenges, and future research opportunities. We first review the integration of AI and communications in the context of 6G, exploring the driving factors behind incorporating AI into wireless communications, as well as the vision for the convergence of AI and 6G. The discourse then transitions to a detailed exposition of the envisioned integration of AI within 6G networks, delineated across three progressive developmental stages. The first stage, AI for network, focuses on employing AI to augment network performance, optimize efficiency, and enhance user service experiences. The second stage, network for AI, highlights the role of the network in facilitating and buttressing AI operations and presents key enabling technologies, such as digital twins for AI and semantic communication. The final stage, AI as a Service, it is anticipated that future 6G networks will innately provide AI functions as services, supporting application scenarios like immersive communication and intelligent industrial robots. Specifically, we have defined the quality of AI service, which refers to a framework for measuring AI services within the network. We further summarize the standardization process of AI for wireless networks, highlighting key milestones and ongoing efforts. In addition, we conduct an in-depth analysis of the critical challenges faced by the integration of AI and communications

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Hole Repairing Method Based on Slicing 12th

A Hole Repairing Method Based on Slicing

引用

12th International Conference on e-Learning and Games, Edutainment 2018

作者： Zhao, Yanni Wang, Yinghui Wang, Ningna Ning, Xiaojuan Shi, Zhenghao Zhao, Minghua Lv, Ke Huang, Liangyi Institute of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory of Network Computing and Security Technology Xi’an China Department of Computer Science Shannxi Vocational and Technical College Xi’an China Booking B.V. Herengracht 597 Amsterdam1017 CE Netherlands Institute of Automation Chinese Academy of Sciences Beijing China School of Engineering and Applied Science George Washington University Washington D.C. United States

ISBN: (纸本)9783030237110

The repairing of 3D point cloud holes has an important meaning to ensure the integrity of cloud data. We present a slice-based repairing method for 3D point cloud in this paper. Firstly, the model is horizontal sliced and each slice is projected on a two-dimensional plane, then the band-shaped points obtained during projection are clustered to select boundary points of the hole. Combined with optimal fitting points, the hole repairing point sets in the projection layer are re-sampled based on the cubic B-spline curve to fit boundary points. Finally, all hole repairing point sets in the projection layer are combined in 3D space to finish the entire hole recovery. The experimental results show that the proposed method can effectively repair complex holes for various point cloud models. © 2019, Springer Nature Switzerland AG.

关键词： Curve fitting

来源：评论

学校读者我要写书评

暂无评论

GPPT: Graph pyramid pooling transformer for visual scene

引用

Neurocomputing 2025年 647卷

作者： Zhi-Peng Li Wen-Jian Liu Xin Sun Yi-Jie Pan Valeriya Gribova Vladimir Fedorovich Filaretov Anthony G. Cohn De-Shuang Huang Ningbo Institute of Digital Twin Eastern Institute of Technology Tongxin Road No. 568 Ningbo Zhejiang 315201 China Faculty of Data Science City University of Macau 999078 Macao MEGAROBO Technologies Linglong Street No. 88 Suzhou Jiangsu 215128 China College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing Jiangsu 211106 China Institute of Automation and Control Processes Far Eastern Branch of Russian Academy of Sciences Russia School of Computing University of Leeds Leeds LS2 9JT UK Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology Shanghai East Hospital School of Life Sciences and Technology Tongji University Shanghai 200123 China

In the field of computer vision, network architectures are critical to the performance of tasks. Vision Graph Neural network (ViG) has shown remarkable results in handling various vision tasks with their unique characteristics. However, the lack of multi-scale information in ViG limits its expressive capability. To address this challenge, we propose a Graph Pyramid Pooling Transformer (GPPT), which aims to enhance the performance of the model by introducing multi-scale feature learning. The core advantage of GPPT is its ability to effectively capture and fuse feature information at different scales. Specifically, it first generates multi-level pooled graphs using a graph pyramid pooling structure. Next, it encodes features at each scale using a weight-shared Graph Convolutional Neural network (GCN). Then, it enhances information exchange across scales through a cross-scale feature fusion mechanism. Finally, it captures long-range node dependencies using a transformer module. The experimental results demonstrate that GPPT achieves exceptional performance across various visual scenes, including image classification, and object detection, highlighting its generality and validity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Insight-HXMT and GECAM-C observations of the brightest-of-all-time GRB 221009A

arXiv

引用

arXiv 2023年

作者： An, Zheng-Hua Antier, S. Bi, Xing-Zi Bu, Qing-Cui Cai, Ce Cao, Xue-Lei Camisasca, Anna-Elisa Chang, Zhi Chen, Gang Chen, Li Chen, Tian-Xiang Chen, Wen Chen, Yi-Bao Chen, Yong Chen, Yu-Peng Coughlin, Michael W. Cui, Wei-Wei Dai, Zi-Gao Hussenot-Desenonges, T. Du, Yan-Qi Du, Yuan-Yuan Du, Yun-Fei Fan, Cheng-Cheng Frontera, Filippo Gao, He Gao, Min Ge, Ming-Yu Gong, Ke Gu, Yu-Dong Guan, Ju Guo, Dong-Ya Guo, Zhi-Wei Guidorzi, Cristiano Han, Da-Wei He, Jian-Jian He, Jun-Wang Hou, Dong-Jie Huang, Yue Huo, Jia Ji, Zhen Jia, Shu-Mei Jiang, Wei-Chun Kann, David Alexander Klotz, A. Kong, Ling-Da Lan, Lin Li, An Li, Bing Li, Chao-Yang Li, Cheng-Kui Li, Gang Li, Mao-Shun Li, Ti-Pei Li, Wei Li, Xiao-Bo Li, Xin-Qiao Li, Xu-Fang Li, Yan-Guo Li, Zheng-Wei Liang, Jing Liang, Xiao-Hua Liao, Jin-Yuan Lin, Lin Liu, Cong-Zhan Liu, He-Xin Liu, Hong-Wei Liu, Jia-Cong Liu, Xiao-Jing Liu, Ya-Qing Liu, Yu-Rong Lu, Fang-Jun Lu, Hong Lu, Xue-Feng Luo, Qi Luo, Tao Ma, Bin-Yuan Ma, Fu-Li Ma, Rui-Can Ma, Xiang Maccary, Romain Mao, Ji-Rong Meng, Bin Nie, Jian-Yin Orlandini, Mauro Ou, Ge Peng, Jing-Qiang Peng, Wen-Xi Qiao, Rui Qu, Jin-Lu Ren, Xiao-Qin Shi, Jing-Yan Shi, Qi Song, Li-Ming Song, Xin-Ying Su, Ju Sun, Gong-Xing Sun, Liang Sun, Xi-Lei Tan, Wen-Jun Tan, Ying Tao, Lian Tuo, You-Li Turpin, Damien Wang, Jin-Zhou Wang, Chen Wang, Chen-Wei Wang, Hong-Jun Wang, Hui Wang, Jin Wang, Ling-Jun Wang, Peng-Ju Wang, Ping Wang, Wen-Shuai Wang, Xiang-Yu Wang, Xi-Lu Wang, Yu-Sa Wang, Yue Wen, Xiang-Yang Wu, Bo-Bing Wu, Bai-Yang Wu, Hong Xiao, Sheng-Hui Xiao, Shuo Xiao, Yun-Xiang Xie, Sheng-Lun Xiong, Shao-Lin Xiong, Sen-Lin Xu, Dong Xu, He Xu, Yan-Jun Xu, Yan-Bing Xu, Ying-Chen Xu, Yu-Peng Xue, Wang-Chen Yang, Sheng Yang, Yan-Ji Yang, Zi-Xu Ye, Wen-Tao Yi, Qi-Bin Yi, Shu-Xu Yin, Qian-Qing You, Yuan Yu, Yun-Wei Yu, Wei Yu, Wen-Hui Zeng, Ming Zhang, Bing Zhang, Bin-Bin Zhang, Da-Li Zhang, Fan Zhang, Hong-Mei Zhang, Juan Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences 19B Yuquan Road Beijing100049 China Institut für Astronomie und Astrophysik Kepler Center for Astro and Particle Physics Eberhard Karls Universität Sand 1 Tübingen72076 Germany College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Department of Physics and Earth Science University of Ferrara Via Saragat 1 Ferrara44122 Italy Department of Astronomy Beijing Normal University Beijing100875 China CAS Key Laboratory for Research in Galaxies and Cosmology Department of Astronomy University of Science and Technology of China Hefei230026 China Department of Astronomy Tsinghua University Beijing100084 China Southwest Jiaotong University Chengdu610092 China INAF Osservatorio di Astrofisica e Scienza dello Spazio di Bologna Via Piero Gobetti 101 Bologna40129 Italy University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing100049 China College of physics Sciences Technology Hebei University No. 180 Wusi Dong Road Lian Chi District Hebei Baoding071002 China INFN - Sezione di Ferrara Via Saragat 1 Ferrara44122 Italy Physics and Space Science College China West Normal University China Yunnan Observatories Chinese Academy of Sciences Yunnan Province Kunming650011 China Key Laboratory of Space Astronomy and Technology National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China School of Astronomy and Space Science Nanjing University Nanjing210093 China School of Physics and Optoelectronics Xiangtan University Yuhu District Hunan Xiangtan411105 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China Institute of Astrophysics Central China Normal University Wuhan430079 China Nevada Center for Astrophysics Department of Physics and Astronomy University of

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of Insight-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first ∼1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from ∼ 10 keV to ∼ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy (Eiso) of ∼ 1.5 × 1055 erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at ∼ 950 s from the afterglow starting time TAG, which corresponds to a jet opening angle of ∼ 0.7◦ (ηγn)1/8, where n is the ambient medium density in units of cm−3 and ηγ is the ratio between γ-ray energy and afterglow kinetic energy. The beaming-corrected total γ-ray energy Eγ is ∼ 1.15 × 1051 (ηγn)1/4 erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement. Copyright © 2023, The Authors. All rights reserved.

关键词： Gamma rays

来源：评论

学校读者我要写书评

暂无评论

Transferable Contrastive network for Generalized Zero-Shot Learning

Transferable Contrastive Network for Generalized Zero-Shot L...

引用

International Conference on Computer Vision (ICCV)

作者： Huajie Jiang Ruiping Wang Shiguang Shan Xilin Chen Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China Shanghai Institute of Microsystem and Information Technology CAS Shanghai China School of Information Science and Technology ShanghaiTech University Shanghai China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Zero-shot learning (ZSL) is a challenging problem that aims to recognize the target categories without seen data, where semantic information is leveraged to transfer knowledge from some source classes. Although ZSL has made great progress in recent years, most existing approaches are easy to overfit the sources classes in generalized zero-shot learning (GZSL) task, which indicates that they learn little knowledge about target classes. To tackle such problem, we propose a novel Transferable Contrastive network (TCN) that explicitly transfers knowledge from the source classes to the target classes. It automatically contrasts one image with different classes to judge whether they are consistent or not. By exploiting the class similarities to make knowledge transfer from source images to similar target classes, our approach is more robust to recognize the target images. Experiments on five benchmark datasets show the superiority of our approach for GZSL.

关键词： Semantics Visualization Image recognition Robustness Target recognition Task analysis Fuses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：