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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

57,254 篇 会议
184 册 图书

馆藏范围

57,431 篇 电子文献
7 种 纸本馆藏

日期分布

学科分类号

57,042 篇 工学
- 56,774 篇 计算机科学与技术...
- 7,556 篇 控制科学与工程
- 2,464 篇 软件工程
- 2,057 篇 电气工程
- 483 篇 信息与通信工程
- 360 篇 生物医学工程（可授...
- 67 篇 机械工程
- 57 篇 土木工程
- 23 篇 石油与天然气工程
- 18 篇 生物工程
- 15 篇 仪器科学与技术
4,454 篇 理学
- 3,698 篇 数学
- 368 篇 物理学
- 274 篇 生物学
- 53 篇 科学技术史(分学科...
- 52 篇 统计学（可授理学、...
- 22 篇 系统科学
- 18 篇 化学
2,190 篇 医学
- 1,233 篇 基础医学(可授医学...
- 1,065 篇 临床医学
- 36 篇 特种医学
2,181 篇 文学
- 2,178 篇 外国语言文学
1,356 篇 管理学
- 1,257 篇 管理科学与工程(可...
- 84 篇 图书情报与档案管...
1,231 篇 教育学
- 709 篇 教育学
- 507 篇 心理学(可授教育学...
- 15 篇 体育学
57 篇 法学
- 56 篇 社会学
36 篇 艺术学
- 36 篇 音乐与舞蹈学
35 篇 哲学
- 35 篇 哲学
13 篇 经济学
1 篇 农学
1 篇 军事学

主题

1,258 篇 artificial intel...
1,112 篇 machine learning
978 篇 deep learning
919 篇 data mining
780 篇 multi agent syst...
725 篇 semantics
527 篇 classification
510 篇 reinforcement le...
474 篇 learning systems
463 篇 clustering
439 篇 neural networks
415 篇 ontology
353 篇 natural language...
257 篇 computers
249 篇 rough sets
236 篇 fuzzy sets
230 篇 feature selectio...
219 篇 computer circuit...
213 篇 knowledge repres...
205 篇 logic programmin...

机构

191 篇 univ chinese aca...
107 篇 chinese acad sci...
65 篇 harbin inst tech...
63 篇 polish acad sci ...
62 篇 wroclaw univ sci...
59 篇 soochow univ sch...
55 篇 delft univ techn...
53 篇 carnegie mellon ...
48 篇 beijing univ tec...
44 篇 chinese acad sci...
44 篇 shanghai jiao to...
43 篇 tu wien austria
42 篇 univ sci & techn...
41 篇 czech tech univ ...
40 篇 univ ulsan sch e...
39 篇 beijing jiaotong...
38 篇 tsinghua univ de...
38 篇 north carolina s...
37 篇 nanjing univ sta...
36 篇 tsinghua univ sc...

作者

47 篇 gelbukh alexande...
42 篇 wang lei
36 篇 reis luis paulo
35 篇 pelachaud cather...
35 篇 malerba donato
34 篇 liu yang
33 篇 novais paulo
33 篇 cpalka krzysztof
32 篇 li li
30 篇 ricci alessandro
27 篇 lau nuno
26 篇 wang hui
26 篇 napoli amedeo
25 篇 boryczka urszula
25 篇 rutkowski leszek
25 篇 wang jing
25 篇 pluhacek michal
25 篇 bickmore timothy
25 篇 calvo hiram
24 篇 villasenor-pined...

语言

57,321 篇 英文
116 篇 中文
1 篇 丹麦文

检索条件"丛书名=Lecture notes in artificial intelligence,"

共 57438 条记录，以下是4711-4720 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Fast Convergence of Random Reshuffling Under Over-Parameterization and the Polyak-Lojasiewicz Condition

Fast Convergence of Random Reshuffling Under Over-Parameteri...

引用

5th International Workshop on Learning with Imbalanced Domains - Theory and Applications / European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD)

作者： Fan, Chen Thrampoulidis, Christos Schmidt, Mark Univ British Columbia Dept Comp Sci Vancouver BC Canada Univ British Columbia Dept Elect & Comp Engn Vancouver BC Canada Canada CIFAR AI Chair Amii Montreal PQ Canada

ISBN: (纸本)9783031434204;9783031434211

Modern machine learning models are often over-parameterized and as a result they can interpolate the training data. Under such a scenario, we study the convergence properties of a sampling-without-replacement variant of stochastic gradient descent (SGD) known as random reshuffling (RR). Unlike SGD that samples data with replacement at every iteration, RR chooses a random permutation of data at the beginning of each epoch and each iteration chooses the next sample from the permutation. For under-parameterized models, it has been shown RR can converge faster than SGD under certain assumptions. However, previous works do not show that RR outperforms SGD in over-parameterized settings except in some highly-restrictive scenarios. For the class of Polyak-Lojasiewicz (PL) functions, we show that RR can outperform SGD in over-parameterized settings when either one of the following holds: (i) the number of samples (n) is less than the product of the condition number (kappa) and the parameter (alpha) of a weak growth condition (WGC), or (ii) n is less than the parameter (rho) of a strong growth condition (SGC).

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Aggregation Functions and Extent Structure Preservation in Formal Concept Analysis 1

引用

28th International Conference on Graph-Based Representation and Reasoning (ICCS)

作者： Bejines, Carlos Lopez-Rodriguez, Domingo Ojeda-Hernandez, Manuel Univ Malaga Andalucia Tech Malaga Spain

ISBN: (数字)9783031409608

ISBN: (纸本)9783031409592;9783031409608

Formal Concept Analysis (FCA) is a mathematical framework for analysing data tables that capture the relationship between objects and attributes. The concept lattice derived from such a table is a representation of the implicit knowledge about this relationship, where each concept corresponds to a bicluster of objects and attributes. FCA has been widely used for knowledge acquisition and representation, conceptual data analysis, information retrieval and other applications. In this paper, we use an extension of the classical FCA to deal with fuzzy formal contexts, where the relationship between objects and attributes is modelled by truth values indicating the degree to which an object possesses a property or attribute. Fuzzy Formal Concept Analysis (FFCA) allows us to capture vague or imprecise information and handle uncertainty or ambiguity in data analysis. Our purpose is to use aggregation functions in order to manipulate and explore fuzzy formal concepts in different ways depending on the desired properties or criteria. In this work, we will focus on the structure of the extents of the concept lattice. We define the aggregation of fuzzy extents point-wise and study how it affects its structure. We characterise the aggregation functions that preserve the fuzzy extent structure and show that they depend on the number of objects in the context. Our results contribute to a better understanding of how aggregation functions can be used to manipulate and explore fuzzy formal concepts.

关键词： Aggregation Function Formal Concept Analysis Fuzzy Sets

来源：评论

学校读者我要写书评

暂无评论

New Models of Three-Way Conflict Analysis for Incomplete Situation Tables

New Models of Three-Way Conflict Analysis for Incomplete Sit...

引用

International Joint Conference on Rough Sets (IJCRS)

作者： Lin, Chengmei Xiao, Qimei Yu, Huiying Lang, Guangming Changsha Univ Sci & Technol Sch Math & Stat Changsha 410114 Hunan Peoples R China

ISBN: (纸本)9783031509582;9783031509599

For conflict problems, attitudes of agents on issues are often lost due to some mistakes, and trisecting a set of agents is an important research topic of conflict analysis, and three-way decisions with rankings and references provides an effective method for trisecting a set of agents. In this paper, we divide a set of issues into two disjoint parts from different perspectives, and give the support and opposition rankings of issues and the support and opposition reference tuples for an incomplete situation table. Then, we design an alliance measure with regard to an issue by a transition probability function, and develop an additive alliance measure regarding multiple issues with conditional weights of issues. Afterwards, we take the additive alliance measure to trisect a set of agents towards multiple issues, and give three types of decision rules by considering the weights of agents. Finally, we design an algorithm for deriving three types of decision rules, and use an example to show how to make decisions with the proposed model.

关键词： Alliance measure Conflict analysis Incomplete three-valued situation table Ranking Reference tuple

来源：评论

学校读者我要写书评

暂无评论

Generalization Ability in Medical Image Analysis with Small-Scale Imbalanced Datasets: Insights from Neural Network Learning 22nd

Generalization Ability in Medical Image Analysis with Small-...

引用

22nd EPIA Conference on artificial intelligence (EPIA)

作者： Biloborodova, Tetiana Brosnan, Brid Skarga-Bandurova, Inna Strauss, Daniel J. Saarland Univ Fac Med Syst Neurosci & Neurotechnol Unit Neuroctr Saarbrucken Germany Htw Saar Sch Engn Saarbrucken Germany Oxford Brookes Univ Oxford England

ISBN: (纸本)9783031490101;9783031490118

Within the medical image analysis domain, the lack of extensive and well-balanced datasets has posed a significant challenge to traditional machine learning approaches, resulting in poor generalization ability of the models. In light of this, we propose a novel approach to evaluate the efficacy of neural network learning on small imbalanced datasets. The proposed methodology uncovers the relationships between model generalization ability, neural network properties, model complexity, and dataset resizing. This research highlights several key findings: (1) data augmentation techniques effectively enhance the generalization ability of neural network models;(2) a neural network model with a minimal number of each layer type can achieve superior generalization ability;(3) regularization layers prove to be a crucial factor in achieving higher generalization ability;(4) the number of epochs is not a determining factor in enhancing generalization ability;(5) complexity measures exhibit no significant correlation with generalization ability in the described scenarios. The findings from this study offer a practical roadmap for model selection, architecture search, and evaluation of the methods' effectiveness in medical image analysis.

关键词： Generalization Ability Convolution Neural Network Medical Image Analysis

来源：评论

学校读者我要写书评

暂无评论

An Improved Cross-Validated Adversarial Validation Method 1

引用

16th International Conference on Knowledge Science, Engineering and Management (KSEM)

作者： Zhang, Wen Liu, Zhengjiang Xue, Yan Wang, Ruibo Cao, Xuefei Li, Jihong Shanxi Univ Sch Automat & Software Engn Taiyuan 030006 Peoples R China Shanxi Univ Sch Comp & Informat Technol Taiyuan 030006 Peoples R China Shanxi Univ Sch Modern Educ Technol Taiyuan 030006 Peoples R China

ISBN: (数字)9783031402838

ISBN: (纸本)9783031402821;9783031402838

As a widely-used strategy among Kaggle competitors, adversarial validation provides a novel selection framework of a reasonable training and validation sets. An adversarial validation heavily depends on an accurate identification of the difference between the distributions of the training and test sets released in a Kaggle competition. However, the typical adversarial validation merely uses a K-fold cross-validated point estimator to measure the difference regardless of the variation of the estimator. Therefore, the typical adversarial validation tends to produce unpromising false positive conclusions. In this study, we reconsider the adversarial validation from a perspective of algorithm comparison. Specifically, we formulate the adversarial validation into a comparison task of a well-trained classifier with a random-guessing classifier on an adversarial data set. Then, we investigate the state-of-the-art algorithm comparison methods to improve the adversarial validation method for reducing false positive conclusions. We conducted sufficient simulated and real-world experiments, and we showed the recently-proposed 5 x 2 BCV McNemar's test can significantly improve the performance of the adversarial validation method.

关键词： Adversarial Validation Cross Validation Algorithm Comparison Significance Testing Distribution Shift

来源：评论

学校读者我要写书评

暂无评论

Mining Frequent Sequential Subgraph Evolutions in Dynamic Attributed Graphs 27th

Mining Frequent Sequential Subgraph Evolutions in Dynamic At...

引用

27th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD)

作者： Cheng, Zhi Andriamampianina, Landy Ravat, Franck Song, Jiefu Valles-Parlangeau, Nathalie Fournier-Viger, Philippe Selmaoui-Folcher, Nazha Activus Grp 1 Chemin Pigeonnier Cepiere F-31100 Toulouse France Univ Toulouse 1 Capitole UT1 UMR 5505 IRIT CNRS 2 Rue Doyen Gabriel Marty F-31042 Toulouse 09 France Univ Pau & Pays Adour Pau France Shenzhen Univ Shenzhen Peoples R China Univ New Caledonia ISEA BP R4 Noumea 98851 New Caledonia

ISBN: (纸本)9783031333767;9783031333774

Mining patterns in a dynamic attributed graph has received more and more attention recently. However, it is a complex task because both graph topology and attributes values of each vertex can change over time. In this work, we focus on the discovery of frequent sequential subgraph evolutions (FSSE) in such a graph. These FSSE patterns occur both spatially and temporally, representing frequent evolutions of attribute values for general sets of connected vertices. A novel algorithm, named FSSEMiner, is proposed to mine FSSE patterns. This algorithm is based on a new strategy (graph addition) to guarantee mining efficiency. Experiments performed on benchmark and real-world datasets show the interest of our approach and its scalability.

关键词： dynamic attributed graph frequent sequential pattern graph mining

来源：评论

学校读者我要写书评

暂无评论

Improving Stroke Trace Classification Explainability Through Counterexamples 21st

Improving Stroke Trace Classification Explainability Through...

引用

21st International Conference on artificial intelligence in Medicine (AIME)

作者： Leonardi, Giorgio Montani, Stefania Striani, Manuel Univ Piemonte Orientale Lab Integrato Intelligenza Artificiale & Informat Azienda Osped Ss Antonio & Biagio & Cesare Arrigo Alessandria Italy

ISBN: (纸本)9783031343438;9783031343445

Deep learning process trace classification is proving powerful in several application domains, including medical ones;however, classification results are typically not explainable, an issue which is particularly relevant in medicine. In our recent work we tackled this problem, by proposing trace saliency maps, a novel tool able to highlight what trace activities are particularly significant for the classification task. A trace saliency map is built by generating artificial perturbations of the trace at hand that are classified in the same class as the original one, called examples. In this paper, we investigate the role of counterexamples (i.e., artificial perturbations that are classified in a different class with respect to the original trace) in refining trace saliency map information, thus improving explainability. We test the approach in the domain of stroke.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Is It Possible to Measure Real-Time VR Motion Sickness with EDA Wavelet Features? 4th

Is It Possible to Measure Real-Time VR Motion Sickness with ...

引用

4th International Conference on artificial intelligence in HCI (AI-HCI) Held as Part of the 25th International Conference on Human-Computer Interaction (HCII)

作者： Seong, Sujin Park, Jaehyun Incheon Univ Dept Ind Management Engn Incheon South Korea

ISBN: (纸本)9783031358906;9783031358913

Virtual reality (VR) has emerged as a more commercial mainstream, and the number of users complaining of VR motion sickness is increasing rapidly. As a result, many methods, physiological indicators: electrogastrography (EGG), heart rate (HR), temperature, electrodermal activity (EDA), subjective measurement methods, simulator sickness questionnaire (SSQ), virtual reality symptom questionnaire (VRSQ), fast motion sickness score (FMS), have been studied to quantify VR motion sickness. Consequently, this study attempted to track motion sickness using EDA (sweat). The study group consisted of ten female and ten male participants who have access to VR (average age: 21.2 years;standard deviation: 2.07 years) with no physical or visual health problems. The VR environment was designed by wearing a head-mounted display (HMD) through a simple operation method. Subjects wore an EDA sensor (Empatica E4) in a VR environment and were asked to respond to SSQ, VRSQ, and FMS questionnaires. For all items of FMS and SSQ (nausea, oculomotor, disorientation, and total) and Total of VRSQ, the coefficient of determination was high in the order of 1(st) trial > 2nd trial > Rest. Overall, the motion sickness score was rated the lowest during the rest period. The coefficient of determination of EDA (sweat) in rest was low in all except Disorientation in VRSQ. And VR motion sickness may have different symptoms complaining to the user depending on the VR environment. Hence, this study suggests that the EDA (sweat) signal may be suitable depending on the user's immersion interval and the symptoms.

关键词： HMD VR motion sickness EDA VRSQ SSQ FMS

来源：评论

学校读者我要写书评

暂无评论

Comparison of Geospatial Trajectory Clustering and Feature Trajectory Clustering for Public Transportation Trip Data 18th

Comparison of Geospatial Trajectory Clustering and Feature T...

引用

18th International Conference on Hybrid artificial intelligence Systems

作者： Cogollos Adrian, Hector Baruque Zanon, Bruno Porras Alfonso, Santiago Dolezel, Petr Univ Burgos Dept Digitalizac Grp Inteligencia Computac Aplicada GICAP Escuela Politecn Super Av Cantabria S-N Burgos 09006 Spain Univ Burgos Fac Ciencias Econ & Empresariales Dept Econ Aplicada Metaheurist GRINUBUMET Pza Infanta Dl Elena S-N Burgos 09001 Spain Univ Pardubice Fac Elect Engn & Informat Studentska 95 Pardubice 53210 Czech Republic

ISBN: (纸本)9783031407246;9783031407253

One of the techniques for the analysis of travel patterns on a public transport network is the clustering of the users movements, in order to identify movement patterns. This paper analyses and compares two different methodologies for public transport trajectory clustering: feature clustering and geospatial trajectory clustering. The results of clustering trip features, such as origin, destination, or distance, are compared against the clustering of travelled trajectories by their geospatial characteristics. Algorithms based on density and hierarchical clustering are compared for both methodologies. In geospatial clustering, different metrics to measure distances between trajectories are included in the comparison. Results are evaluated by analysing their quality through the silhouette coefficient and graphical representations of the clusters on the map. The results show that geospatial trajectory clustering offers better quality than feature trajectory clustering. Also, in the case of long and complete trajectories, density clustering using edit distance with real penalty distance outperforms other combinations.

关键词： HDBSCAN Agglomerative Clustering Dynamic Time Warping distance Edit distance with Real Penalty

来源：评论

学校读者我要写书评

暂无评论

Identifying Cannabis Use Risk Through Social Media Based on Deep Learning Methods 21st

Identifying Cannabis Use Risk Through Social Media Based on ...

引用

21st International Conference on artificial intelligence and Soft Computing (ICAISC)

作者： Ibrahim, Doaa Inkpen, Diana Al Osman, Hussein Ottawa Univ Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9783031234798;9783031234804

Cannabis is the most used drug around the world with the highest risks and associated criminal problems in many countries. This research describes the process of classifying online posts to identify cannabis use problems and their associated risks as early as possible. We annotated 11,008 online posts, which we used to build robust classification models. We tested classical and deep learning classifiers. Different CNN- and RNN-based models proved to be promising approaches to detect cannabis use posts. Our system can be used by authorities (such as parents or doctors) to monitor cannabis use-related posts. It could raise an alarm to the relevant authorities to take necessary interventions to analyze the cannabis use risks associated with the posts. To the best of our knowledge, this is the first study that uses deep learning methods successfully to detect cannabis use from any text or online posts. We tested our deep learning models on the SubUse-Cann unseen dataset which contains 17,099 tweets. It is an imbalanced dataset with only 6.9% positive cannabis use tweets. Our CNN-based model performed the best with an accuracy of 95.25% and an F1-score of 92.83% for classifying cannabis use.

关键词： CNN LSTM Attention Cannabis Marijuana Weed Substance use Classification Risk behavior

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 468 469 470 471 472 473 474 475 476 477 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：