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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,117 篇 会议
141 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

2,141 篇 工学
- 1,954 篇 计算机科学与技术...
- 1,095 篇 软件工程
- 405 篇 信息与通信工程
- 287 篇 电气工程
- 267 篇 生物工程
- 217 篇 控制科学与工程
- 172 篇 生物医学工程（可授...
- 79 篇 化学工程与技术
- 73 篇 光学工程
- 72 篇 机械工程
- 68 篇 仪器科学与技术
- 65 篇 电子科学与技术（可...
- 62 篇 安全科学与工程
- 55 篇 动力工程及工程热...
- 54 篇 网络空间安全
777 篇 理学
- 430 篇 数学
- 296 篇 生物学
- 151 篇 统计学（可授理学、...
- 147 篇 物理学
- 127 篇 系统科学
- 90 篇 化学
505 篇 管理学
- 306 篇 图书情报与档案管...
- 231 篇 管理科学与工程(可...
- 95 篇 工商管理
218 篇 医学
- 193 篇 临床医学
- 125 篇 基础医学(可授医学...
- 87 篇 药学(可授医学、理...
- 55 篇 公共卫生与预防医...
72 篇 法学
- 70 篇 社会学
52 篇 教育学
- 47 篇 教育学
35 篇 经济学
31 篇 农学
6 篇 艺术学
4 篇 军事学
1 篇 文学

主题

568 篇 data mining
542 篇 machine learning
241 篇 pattern recognit...
195 篇 deep learning
174 篇 feature extracti...
154 篇 artificial intel...
153 篇 support vector m...
113 篇 accuracy
113 篇 machine learning...
111 篇 training
93 篇 data models
80 篇 neural networks
77 篇 data mining and ...
65 篇 classification
62 篇 sentiment analys...
61 篇 classification a...
59 篇 big data
57 篇 predictive model...
50 篇 face recognition
48 篇 prediction algor...

机构

7 篇 maharishi school...
6 篇 guangdong univer...
5 篇 galgotias univer...
5 篇 centre of interd...
5 篇 pune
5 篇 chitkara univers...
5 篇 uttaranchal univ...
5 篇 uttaranchal inst...
5 篇 institute of aut...
4 篇 shanghai jiao to...
4 篇 chitkara univers...
4 篇 school of inform...
4 篇 indian statistic...
4 篇 south china univ...
4 篇 zhejiang univers...
4 篇 maharishi school...
4 篇 department of cs...
4 篇 university of ca...
4 篇 school of comput...
4 篇 department of co...

作者

9 篇 de-shuang huang
7 篇 coenen frans
7 篇 venkatesh svetha
7 篇 petra perner
7 篇 tianrui li
6 篇 ryszard tadeusie...
6 篇 marcin korytkows...
6 篇 jacek m. zurada
6 篇 krasotkina olga
6 篇 lotfi a. zadeh
6 篇 mottl vadim
6 篇 leszek rutkowski
5 篇 vitoantonio bevi...
5 篇 sankar k. pal
4 篇 waiyamai kitsana
4 篇 sozo inoue
4 篇 sergei o. kuznet...
4 篇 duoqian miao
4 篇 shengli xie
4 篇 hepu deng

语言

3,063 篇 英文
209 篇 其他
38 篇 中文
1 篇 西班牙文
1 篇 土耳其文

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

共 3282 条记录，以下是2701-2710 订阅

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

详细简洁

排序：

Cross-Document Coreference Resolution based on Automatic Text Summary

Cross-Document Coreference Resolution based on Automatic Tex...

引用

3rd international conference on Knowledge Discovery and data mining

作者： Gao, Sanyuan Li, Si Xu, Weiran Guo, Jun Beijing Univ Posts & Telecommun Pattern Recognit & Intelligent Syst Lab Beijing 100088 Peoples R China

ISBN: (纸本)9780769539232

Cross-document coreference resolution plays an import part in the filed of natural language processing (NLP). It captures the ability of gathering documents for information about a certain entity. Most previous algorithms identify the underlying entity of a given document depending on the original text, which is unreliable if the original text contains multiple parts of different themes. In this paper, we propose a cross-document coreference resolution algorithm based on automatic text summary instead of the original text. In our approach, we extract query-specific and informative-indicative summary from the original text by using Hobbs algorithm and measure the similarity between two summaries. This automatic text summary-based cross-document coreference resolution (ATSCDCR) system is effective in disambiguating different entities of the same mention name and identifying the same entity of different mention names. The results from our experiments show that the macro average of ATSCDCR system is up to 73.16% and the micro average of ATSCDCR system is 67.34%.

关键词： Hobbs Algorithm Automatic Text Summary Named Entity Type recognition Cross-Document Coreference Resolution

来源：评论

学校读者我要写书评

暂无评论

3rd IFIP TC 12 international conference on Artificial Intelligence, IFIP AI 2010 Held as Part of 21st IFIP World Computer Congress, WCC 2010

引用

3rd IFIP TC 12 international conference on Artificial Intelligence, IFIP AI 2010 Held as Part of 21st IFIP World Computer Congress, WCC 2010

ISBN: (纸本)3642152856

The proceedings contain 25 papers. The special focus in this conference is on Agents, Knowledge Acquisition, data mining, machine learning, Neural Nets and Intelligent Systems Engineering. The topics include: Involving the human user in the control architecture of an autonomous agent;transferring hopscotch from the schoolyard to the classroom;social relationships as a means for identifying an individual in large information spaces;a methodology for inducing pre-pruned modular classification rules;enhancement of infrequent purchased product recommendation using data mining techniques;a machine learning approach to predicting winning patterns in track cycling omnium;learning motor control by dancing YMCA;analysis and comparison of probability transformations for fusing sensors with uncertain detection performance;a case-based approach to business process monitoring;a survey on the dynamic scheduling problem in astronomical observations;combining determinism and intuition through univariate decision strategies for target detection from multi-sensors;a UML profile oriented to the requirements modeling in intelligent tutoring systems projects;learning by collaboration in intelligent autonomous systems;full text search engine as scalable k-nearest neighbor recommendation system;following a developing story on the web;computer-aided estimation for the risk of development of gastric cancer by image processing;intelligent hybrid architecture for tourism services;knowledge-based geo-risk assessment for an intelligent measurement system and case-based decision support in time dependent medical domains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Feature selection based on modified minimize entropy principle

Feature selection based on modified minimize entropy princip...

引用

2010 international conference on Electronics and Information Engineering, ICEIE 2010

作者： Chen, Jr-Shian Chou, Hung-Lieh Tai, David Wen-Shung Department of Computer Science and Information Management Hungkuang University No.34 Chung-Chie Road Shalu Taichung 433 Taiwan Department of Computer Center National Yunlin University of Science and Technology St. Joseph's Hospital No. 74Sinsheng Rd. Huwei Township Yunlin County 632 Taiwan

ISBN: (纸本)9781424476800

Feature selections have seen growing importance placed on statistics, pattern recognition, machine learning and data mining. Researchers have demonstrated the interest in the methods for improving the performance of their forecasting results. Therefore, this study proposes a feature selection approach, which based on minimize entropy principle approach. Experimental results have shown that the proposed model provided more average accuracy rate and stability then other methods. © 2010 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

data mining Techniques for Proactive Fault Diagnostics of Electronic Gaming machines

Data Mining Techniques for Proactive Fault Diagnostics of El...

引用

23rd Canadian conference on Artificial Intelligence

作者： Butler, Matthew Keselj, Vlado Univ York Fac Comp Sci Artificial Intelligence Grp York YO10 5DD N Yorkshire England Dalhousie Univ Fac Comp Sci Halifax NS Canada

ISBN: (纸本)9783642130588

This paper details the preliminary research into modeling the behavior of Electronic Gaming machines (EGM) for the task of proactive fault diagnostics. The EGMs operate within a state space and therefore their behavior was modeled, using supervised learning, as the frequency at which a given machine is operating in a particular state. The results indicated that EGMs did exhibit measurably different behavior when they were about to experience a fault and these relationships were modeled effectively by several algorithms.

关键词： Decision Trees Support Vector machines Proactive Fault Diagnosis pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A novel robustness image watermarking scheme based on fuzzy support vector machine

A novel robustness image watermarking scheme based on fuzzy ...

引用

2010 3rd IEEE international conference on Computer Science and Information Technology, ICCSIT 2010

作者： Li, Lei Ding, Wen-Yan Li, Jin-Yan College of Automation Nanjing University of Post and Telecommunications Pattern Recognition and Intelligence System Nanjing 210003 China

ISBN: (纸本)9781424455386

In this paper, a novel fuzzy support vector machine based image watermarking scheme is proposed. Since the application of support vector machine in the process of watermarking technology is only a simple classification of the image. However, the fuzzy support vector machines by selecting the appropriate degree of membership to reflect the different importance of the different sample points. In this article, Firstly, we split the given image into 8 * 8 block, then calculated for each sub-block of the texture features as input vectors to train the support vector machine. The image sub-block is divided into two categories (one category is "-1" represents a weak texture, the other is "+1" represents a strong texture),and we make the strong texture as more important category in this paper. Therefore, given its larger fuzzy membership than the weak texture's. From the relevant theory of watermarking technology we know that a strong local image texture can tolerate more of the watermark information. In order to enhance watermark robustness and embedding more watermark information in the host image, we improve the accuracy of classifying one class(a strong texture). If the data points belonging to the class of strong texture are incorrectly categorized into the weak texture class, the amount of embedded watermarks are reduced and robustness(the ability of resisting attacks) of the image is decreased. Results show that this algorithm has good robustness against common image attacks. © 2010 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

User navigation behavior mining using multiple data domain description

User navigation behavior mining using multiple data domain d...

引用

2010 3rd IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2010

作者： Xue, Li Chen, Ming Xiong, Yun Zhu, Yangyong School of Computer Science Fudan University Shanghai 200433 China

ISBN: (纸本)9780769541914

User Navigation Behavior mining (UNBM) mainly studies the problems of extracting the interesting user access patterns from user access sequences (UAS), which are usually used for user access prediction and web page recommendation. Through analyzing the real world web data, we find most of user access sequences carrying hybrid features of different patterns, rather than a single one. Therefore, the methods that categorize one access sequence into a single pattern, can hardly obtain good quality results. Due to this problem, we propose a multi-task learning approach based on multiple data domain description model (MDDD), which simultaneously captures correlations among patterns and allowing categorizing one UAS into more than one patterns. The experimental results show that our method achieves high performances in both precision and recall by virtue of using MDDD model. © 2010 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence in Theory and Practice III - Third IFIP TC 12 international conference on Artificial Intelligence, IFIP AI 2010, Held as Part of WCC 2010, Proceedings

引用

3rd IFIP TC 12 international conference on Artificial Intelligence, IFIP AI 2010

ISBN: (纸本)3642152856

The proceedings contain 25 papers. The topics discussed include: exer-learning games: transferring hopscotch from the schoolyard to the classroom;social relationships as a means for identifying an individual in large information spaces;J-PMCRI: a methodology for inducing pre-pruned modular classification rules;enhancement of infrequent purchased product recommendation using data mining techniques;a machine learning approach to predicting winning patterns in track cycling omnium;learning motor control by dancing YMCA;analysis and comparison of probability transformations for fusing sensors with uncertain detection performance;a case-based approach to business process monitoring;a survey on the dynamic scheduling problem in astronomical observations;and combining determinism and intuition through univariate decision strategies for target detection from multi-sensors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impact of K-Means on the Performance of Classifiers for Labeled data

Impact of K-Means on the Performance of Classifiers for Labe...

引用

3rd international conference on Contemporary Computing

作者： Patil, B. M. Joshi, R. C. Toshniwal, Durga Indian Inst Technol Dept Elect & Comp Engn Roorkee 247667 Uttarakhand India

ISBN: (纸本)9783642148330

In this study a novel framework for data mining in clinical decision making have been proposed. Our framework addresses the problems of assessing and utilizing data mining models in medical domain. The framework consists of three stages. The first stage involves preprocessing of the data to improve its quality. The second stage employs k-means clustering algorithm to cluster the data into k clusters (in our case, k=2 i.e. cluster / no, cluster1 / yes) for validation the class labels associated with the data. After clustering, the class labels associated with the data is compared with the labels generated by clustering algorithm if both the labels are same it is assumed that the data is correctly classified. The instances for which the labels are not same are considered to be misclassified and are removed before further processing. In the third stage support vector machine classification is applied. The classification model is validated by using k-fold cross validation method. The performance of SVM (Support Vector machine) classifier is also compared with Naive Bayes classifier. In our case SVM classifier outperforms the Naive Bayes classifier. To validate the proposed framework, experiments have been carried out on benchmark datasets such as Indian Pima diabetes dataset and Wisconsin breast cancer dataset (WBCD). These datasets were obtained from the University of California at Irvine (UCI) machine learning repository. Our proposed study obtained classification accuracy on both datasets, which is better with respect to the other classification algorithms applied on the same datasets as cited in the literature. The performance of the proposed framework was also evaluated using the sensitivity and specificity measures.

关键词： Classification Performance measure Pima Indian diabetes data k-Means k-fold cross-validation

来源：评论

学校读者我要写书评

暂无评论

On Locality Sensitive Hashing in metric spaces 10

On Locality Sensitive Hashing in metric spaces

引用

Proceedings of the Third international conference on SImilarity Search and APplications

作者： Tellez, Eric Sadit Chavez, Edgar Universidad Michoacana México Universidad Michoacana CICESE Mexico

ISBN: (纸本)9781450304207

Modeling proximity search problems as a metric space provides a general framework usable in many areas, like pattern recognition, web search, clustering, data mining, knowledge management, textual and multimedia information retrieval, to name a few. Metric indexes have been improved over the years and many instances of the problem can be solved efficiently. However, when very large/high dimensional metric databases are indexed exact approaches are not yet capable of solving efficiently the problem, the performance in these circumstances is degraded to almost sequential search. To overcome the above limitation, non-exact proximity searching algorithms can be used to give answers that either in probability or in an approximation factor are close to the exact result. Approximation is acceptable in many contexts, specially when human judgement about closeness is involved. In vector spaces, on the other hand, there is a very successful approach dubbed Locality Sensitive Hashing which consist in making a succinct representation of the objects. This succinct representation is relatively insensitive to small variations of the locality. Unfortunately, the hashing function have to be carefully designed, very close to the data model, and different functions are used when objects come from different domains. In this paper we give a new schema to encode objects in a general metric space with a uniform framework, independent from the data model. Finally, we provide experimental support to our claims using several real life databases with different data models and distance functions obtaining excellent results in both the speed and the recall sense, specially for large databases. Copyright 2010 ACM.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Using machine learning techniques to enhance the performance of an automatic backup and recovery system 10

Using machine learning techniques to enhance the performance...

引用

3rd Annual Haifa Experimental Systems conference, SYSTOR 2010

作者： Pelleg, Dan Raichstein, Eran Ronen, Amir IBM Haifa Research Lab. Haifa University Campus Mount Carmel Haifa Israel IBM Software Group Building 30 Matam Haifa Israel

ISBN: (纸本)9781605589084

A typical disaster recovery system will have mirrored storage at a site that is geographically separate from the main operational site. In many cases, communication between the local site and the backup repository site is performed over a network which is inherently slow, such as a WAN, or is highly strained, for example due to a whole-site disaster recovery operation. The goal of this work is to alleviate the performance impact of the network in such a scenario, and to do so using machine learning techniques. We focus on two main areas, prefetching and read-ahead size determination. In both cases we significantly improve the performance of the system. Our main contributions are as follows: We introduce a theoretical model of the system and the problem we are trying to solve and bound the gain from prefetching techniques. We construct two frequent pattern mining algorithms and use them for prefetching. A framework for controlling and combining multiple prefetch algorithms is presented as well. These algorithms, as well as various simple prefetch algorithms, are compared on a simulation environment. We introduce a novel algorithm for determining the amount of read ahead on such a system that is based on intuition from online competitive analysis and on regression techniques. The significant positive impact of this algorithm is demonstrated on IBM's FastBack system. Much of our improvements have been applied with little or no modification of the current implementation's internals. We therefore feel confident in stating that the techniques are general and are likely to have applications elsewhere. Copyright 2010 ACM.

关键词： learning algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共329页 << < 267 268 269 270 271 272 273 274 275 276 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：