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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,156 篇 会议
173 册 图书
28 篇 期刊文献

馆藏范围

3,356 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,251 篇 工学
- 2,046 篇 计算机科学与技术...
- 1,087 篇 软件工程
- 408 篇 信息与通信工程
- 359 篇 电气工程
- 249 篇 生物工程
- 176 篇 控制科学与工程
- 157 篇 生物医学工程（可授...
- 73 篇 光学工程
- 73 篇 化学工程与技术
- 70 篇 机械工程
- 63 篇 仪器科学与技术
- 61 篇 电子科学与技术（可...
- 60 篇 安全科学与工程
- 48 篇 交通运输工程
- 40 篇 动力工程及工程热...
- 38 篇 材料科学与工程（可...
719 篇 理学
- 378 篇 数学
- 273 篇 生物学
- 169 篇 物理学
- 148 篇 统计学（可授理学、...
- 104 篇 系统科学
- 70 篇 化学
467 篇 管理学
- 305 篇 图书情报与档案管...
- 206 篇 管理科学与工程(可...
- 99 篇 工商管理
300 篇 医学
- 273 篇 临床医学
- 125 篇 基础医学(可授医学...
- 70 篇 药学(可授医学、理...
- 53 篇 公共卫生与预防医...
64 篇 法学
- 57 篇 社会学
32 篇 经济学
31 篇 教育学
28 篇 农学
6 篇 艺术学
3 篇 军事学
1 篇 文学

主题

550 篇 data mining
550 篇 machine learning
291 篇 pattern recognit...
244 篇 deep learning
192 篇 feature extracti...
163 篇 support vector m...
156 篇 artificial intel...
127 篇 accuracy
123 篇 training
117 篇 machine learning...
100 篇 data models
93 篇 data mining and ...
75 篇 classification
73 篇 convolutional ne...
72 篇 neural networks
70 篇 predictive model...
69 篇 computational mo...
68 篇 big data
59 篇 sentiment analys...
55 篇 learning systems

机构

10 篇 chinese academy ...
9 篇 chitkara centre ...
8 篇 zhejiang univers...
7 篇 guangdong univer...
7 篇 centre of resear...
6 篇 central south un...
6 篇 unsw sydney
6 篇 college of compu...
5 篇 badji mokhtar un...
5 篇 indian institute...
5 篇 xi'an university...
5 篇 shanghai jiao to...
5 篇 indian statistic...
5 篇 southwest jiaoto...
5 篇 kobe university ...
5 篇 southern univers...
4 篇 columbia univers...
4 篇 chitkara univers...
4 篇 institute of big...
4 篇 centre for patte...

作者

12 篇 de-shuang huang
12 篇 venkatesh svetha
8 篇 petra perner
7 篇 phung dinh
7 篇 jacek m. zurada
7 篇 krasotkina olga
7 篇 mottl vadim
6 篇 zheng-guang wu
6 篇 ryszard tadeusie...
6 篇 marcin korytkows...
6 篇 hongyi li
6 篇 chaojie li
6 篇 biao luo
6 篇 lotfi a. zadeh
6 篇 kang-hyun jo
6 篇 leszek rutkowski
6 篇 long cheng
6 篇 zhongzhi shi
5 篇 zhang yan
5 篇 vitoantonio bevi...

语言

2,924 篇 英文
416 篇 其他
38 篇 中文

检索条件"任意字段=4th International Conference on Machine Learning and Data Mining in Pattern Recognition"

共 3357 条记录，以下是2691-2700 订阅

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

详细简洁

排序：

Evaluation of a Resource Allocating Network with Long Term Memory Using GPU

Evaluation of a Resource Allocating Network with Long Term M...

引用

10th international conference on Artificial Neural Networks and Genetic Algorithms

作者： Ribeiro, Bernardete Quintas, Ricardo Lopes, Noel Univ Coimbra Dept Informat Engn P-3000 Coimbra Portugal CISUC P-3000 Coimbra Portugal

ISBN: (纸本)9783642202667

Incremental learning has recently received broad attention in many applications of pattern recognition and data mining. With many typical incremental learning situations in the real world where a fast response to changing data is necessary, developing a parallel implementation (in fast processing units) will give great impact to many applications. Current research on incremental learning methods employs a modified version of a resource allocating network (RAN) which is one variation of a radial basis function network (RBFN). this paper evaluates the impact of a Graphics Processing Units (GPU) based implementation of a RAN network incorporating Long Term Memory (LTM) [4]. the incremental learning algorithm is compared with the batch RBF approach in terms of accuracy and computational cost, both in sequential and GPU implementations. the UCI machine learning benchmark datasets and a real world problem of multimedia forgery detection were considered in the experiments. the preliminary evaluation shows that although the creation of the model is faster with the RBF algorithm, the RAN-LTM can be useful in environments with the need of fast changing models and high-dimensional data.

关键词： Incremental learning CPU Computing

来源：评论

学校读者我要写书评

暂无评论

What's your current stress level? Detection of stress patterns from GSR sensor data

What's your current stress level? Detection of stress patter...

引用

11th IEEE international conference on data mining Workshops, ICDMW 2011

作者： Bakker, Jorn Pechenizkiy, Mykola Sidorova, Natalia Department of Computer Science Eindhoven University of Technology P.O. Box 513 Eindhoven 5600MB Netherlands

ISBN: (纸本)9780769544090

the problem of job stress is generally recognized as one of the major factors leading to a spectrum of health problems. People with certain professions, like intensive care specialists or call-center operators, and people in certain phases of their lives, like working parents with young children, are at increased risk of getting overstressed. Stress management should start far before the stress start causing illnesses. the current state of sensor technology allows to develop systems measuring physical symptoms reflecting the stress level. In this paper we (1) formulate the problem of stress identification and categorization from the sensor data stream mining perspective, (2) consider a reductionist approach for arousal identification as a drift detection task, (3) highlight the major problems of dealing with GSR data, collected from a watch-style stress measurement device in normal (i.e. in non-lab) settings, and propose simple approaches how to deal with them, and (4) discuss the lessons learnt from the conducted experimental study on real GSR data collected during the recent field study. © 2011 IEEE.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

learning tags from unsegmented videos of multiple human actions

Learning tags from unsegmented videos of multiple human acti...

引用

11th IEEE international conference on data mining, ICDM 2011

作者： Hospedales, Timothy M. Gong, Shaogang Xiang, Tao Queen Mary University of London E1 4NS United Kingdom

ISBN: (纸本)9780769544083

Providing methods to support semantic interaction with growing volumes of video data is an increasingly important challenge for data mining. To this end, there has been some success in recognition of simple objects and actions in video;however most of this work requires strongly supervised training data. the supervision cost of these approaches therefore renders them economically non-scalable for real world applications. In this paper we address the problem of learning to annotate and retrieve semantic tags of human actions in realistic video data with sparsely provided tags of semantically salient activities. this is challenging because of (1) the multi-label nature of the learning problem and (2) realistic videos are often dominated by (semantically uninteresting) background activity un-supported by any tags of interest, leading to a strong irrelevant data problem. To address these challenges, we introduce a new topic model based approach to video tag annotation. Our model simultaneously learns a low dimensional representation of the video data, which dimensions are semantically relevant (supported by tags), and how to annotate videos with tags. Experimental evaluation on three different video action/activity datasets demonstrate the challenge of this problem, and value of our contribution. © 2011 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Ranking web-based partial orders by significance using a Markov reference model

Ranking web-based partial orders by significance using a Mar...

引用

11th IEEE international conference on data mining, ICDM 2011

作者： Speiser, Michel Antonini, Gianluca Labbi, Abderrahim IBM Zurich Research Laboratory Säumerstrasse 4 CH-8803 Rüschlikon Switzerland

ISBN: (纸本)9780769544083

mining web traffic data has been addressed in literature mostly using sequential pattern mining techniques. Recently, a more powerful pattern called partial order was introduced, with the hope of providing a more compact result set. A further approach towards this goal, valid for both sequential patterns and partial orders, consists in building a statistical significance test for frequent patterns. Our method is based on probabilistic generative models and provides a direct way to rank the extracted patterns. It leaves open the number of patterns of interest, which depends on the application, but provides an alternative criterion to frequency of occurrence: statistical significance. In this paper, we focus on the construction of an algorithm which calculates the probability of partial orders under a first-order Markov reference model, and we show how to use those probabilities to assess the statistical significance of a set of mined partial orders. © 2011 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

machine learning for Affective Computing 4th

Machine Learning for Affective Computing

引用

4th Bi-Annual international conference of the Humaine Association on Affective Computing and Intelligent Interaction (ACII 2011)

作者： Hoque, Mohammed McDuff, Daniel J. Morency, Louis-Philippe Picard, Rosalind W. MIT Media Lab 77 Massachusetts Ave Cambridge MA 02139 USA Univ Southern California Inst Creat Technol Marina Del Rey CA 90292 USA

ISBN: (纸本)9783642245701

Affective computing (AC) is a unique discipline which includes modeling affect using one or multiple modalities by drawing on techniques from many different fields. AC often deals with problems that are known to be very complex and multi-dimensional, involving different kinds of data (numeric, symbolic, visual etc.). However, with the advancement of machine learning techniques, a lot of those problems are now becoming more tractable.

关键词： spontaneous affective states automated recognition of affect multimodal data fusion probabilistic modeling feature selection

来源：评论

学校读者我要写书评

暂无评论

N DoT: Nearest Neighbor Distance Based Outlier Detection Technique

引用

4th international conference on pattern recognition and machine Intelligence (PReMI)

作者： Hubballi, Neminath Patra, Bidyut Kr. Nandi, Sukumar Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India Tezpur Univ Dept Comp Sci & Engn Tezpur India

ISBN: (纸本)9783642217869

In this paper, we propose a nearest neighbor based outlier detection algorithm, N DoT. We introduce a parameter termed as Nearest Neighbor Factor (NNF) to measure the degree of outlierness of a point with respect to its neighborhood. Unlike the previous outlier detection methods N DoT works by a voting mechanism. Voting mechanism binarizes the decision compared to the top-N style of algorithms. We evaluate our method experimentally and compare results of N DoT with a classical outlier detection method LOF and a recently proposed method LDOF. Experimental results demonstrate that N DoT outperforms LDOF and is comparable with LOF.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Improving models of slipping, guessing, and moment-by-moment learning with estimates of skill difficulty

Improving models of slipping, guessing, and moment-by-moment...

引用

4th international conference on Educational data mining, EDM 2011

作者： Gowda, Sujith M. Rowe, Jonathan P. Baker, Ryan S.J.D. Chi, Min Koedinger, Kenneth R. Department of Social Science and Policy Studies Worcester Polytechnic Institute Worcester MA United States Department of Computer Science North Carolina State University 890 Oval Drive Raleigh United States Developmental and Psychological Sciences Stanford University 485 Lasuen Mall Stanford CA 94305 United States Department of Social Science and Policy Studies Human-Computer Interaction Institute Carnegie Mellon University 5000 Forbes Ave. Pittsburgh PA 15213 United States

ISBN: (纸本)9789038625379

Over the past several years, several extensions to Bayesian knowledge tracing have been proposed in order to improve predictions of students' in-tutor and post-test performance. One such extension is Contextual Guess and Slip, which incorporates machine-learned models of students' guess and slip behaviors in order to enhance the overall model's predictive performance [Baker et al. 2008a]. Similar machine learning approaches have been introduced in order to detect specific problem-solving steps during which students most likely learned particular skills [Baker, Goldstein, and Heffernan in press]. However, one important class of features that have not been considered in machine learning models used in these two techniques is metrics of item and skill difficulty, a key type of feature in other assessment frameworks [e.g Hambleton, Swaminathan, & Rogers, 1991;Pavlik, Cen, & Koedinger 2009]. In this paper, a set of engineered features that quantify skill difficulty and related skill-level constructs are investigated in terms of their ability to improve models of guessing, slipping, and detecting moment-by-moment learning. Supervised machine learning models that have been trained using the new skill-difficulty features are compared to models from the original contextual guess and slip and moment-by-moment learning detector work. this includes performance comparisons for predicting students' in-tutor responses, as well as post-test responses, for a pair of Cognitive Tutor data sets.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Classification methods using Winners-Take-All neural networks

Classification methods using Winners-Take-All neural network...

引用

作者： Brenych, Yana Informational Technologies Department Volyn State University Named after Lesia Ukrainka Volia av. 13 Lutsk Ukraine

ISBN: (纸本)9789662191196

Winner-Take-All (WTA) and its extended version K-Winner-Take-All (KWTA) networks have been frequently used as the classifiers in neural networks. they are very important tools in data mining, machine learning and pattern recognition. there are a lot of scientific works devoted to this technology. the elimination of limitations is main aim of the most number of these researches. KWTA is the unique strategy for solving classification problems in different branches of science. this unique character is presented in the research. © 2011 LVIV POLYTECHNIC NATL UNIV.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Intelligent data mining for turbo-generator predictive maintenance: An approach in real-world

Intelligent data mining for turbo-generator predictive maint...

引用

international Workshop on Soft Computing Applications and Knowledge Discovery 2011, SCAKD 2011 - In Conjunction with the 4th international conference on pattern recognition and machine Intelligence, PReMI 2011

作者： Pellicel, Alexandre Cássio, Gonçalo Lopes, Marco Aurélio A. Da Silva, Luiz Eduardo Borges Bonaldi, Erik Leandro De Lacerda De Oliveira, Levy Ely Da Silva, Jonas Guedes Borges Lambert-Torres, Germano Rodrigues, Pierre TermoNorte Energy Thermal Power Plant Co. Porto-Velho Brazil Institute Gnarus Itajuba Brazil Jordão Engineering Co. Rio de Janeiro Brazil

this paper presents the development of a supervision system for predictive maintenance and diagnosis of turbo-generators. the aim of the developed system is to verify the degradation conditions of TermoNorte generators. Initially, a system for extracting features of the turbo-generator operational database has been developed to detect possible problems that cause premature fails. the system has been divided in two parts. the first one is a data acquisition system directly connected to the generator in order to sample some operational variables. the second part concerns an intelligent data mining, based on Rough Sets theory, into the database involving the supervision system variables, to use the existing historic data to perform analysis of the problems and possible causes.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

pattern recognition and classification for multivariate time series

Pattern recognition and classification for multivariate time...

引用

5th international Workshop on Knowledge Discovery from Sensor data, SensorKDD'11 - Held in Conjunction with the 17th ACM SIGKDD conference on Knowledge Discovery and data mining, KDD-2011

作者： Spiegel, Stephan Gaebler, Julia Lommatzsch, Andreas De Luca, Ernesto Albayrak, Sahin DAI-Labor Technische Universitaet Berlin Ernst-Reuter-Platz 7 10587 Berlin Germany

ISBN: (纸本)9781450308328

Nowadays we are faced with fast growing and permanently evolving data, including social networks and sensor data recorded from smart phones or vehicles. Temporally evolving data brings a lot of new challenges to the data mining and machine learning community. this paper is concerned with the recognition of recurring patterns within multivariate time series, which capture the evolution of multiple parameters over a certain period of time. Our approach first separates a time series into segments that can be considered as situations, and then clusters the recognized segments into groups of similar context. the time series segmentation is established in a bottom-up manner according the correlation of the individual signals. Recognized segments are grouped in terms of statistical features using agglomerative hierarchical clustering. the proposed approach is evaluated on the basis of real life sensor data from different vehicles recorded during car drives. According to our evaluation it is feasible to recognize recurring patterns in time series by means of bottom-up segmentation and hierarchical clustering. Copyright 2011 ACM.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共336页 << < 266 267 268 269 270 271 272 273 274 275 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：