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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4 篇 会议

馆藏范围

4 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3 篇 工学
- 3 篇 计算机科学与技术...
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 交通运输工程
- 1 篇 安全科学与工程
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

4 篇 k-nearest algori...
2 篇 machine learning
2 篇 landmarc
2 篇 rfid
1 篇 arduino mega boa...
1 篇 hog algorithm
1 篇 logistic regress...
1 篇 spiral images
1 篇 coffee beans
1 篇 location sensing
1 篇 localization
1 篇 image pattern re...
1 篇 parkinson's dise...

机构

1 篇 inst china elect...
1 篇 panjab univ uiet...
1 篇 division of elec...
1 篇 saveetha school ...
1 篇 pla univ sci & t...

作者

1 篇 qin guangcheng
1 篇 sung ho cho
1 篇 liu rong
1 篇 singh gurpreet
1 篇 surendran r.
1 篇 wen meng
1 篇 kyuwon han
1 篇 liu xing
1 篇 selvanarayanan r...
1 篇 sharma sukesha
1 篇 chandu b.

语言

3 篇 英文
1 篇 其他

检索条件"主题词=K-Nearest Algorithm"

共 4 条记录，以下是1-10 订阅

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

详细简洁

排序：

To Instant of Coffee Beans using k-nearest algorithm over Clustering for Quality and Sorting Process 2

To Instant of Coffee Beans using K-nearest Algorithm over Cl...

引用

2nd International Conference on IT Innovations and knowledge Discovery, ITIkD 2024

作者： Chandu, B. Surendran, R. Selvanarayanan, Raveena Saveetha School of Engineering Department of Computer Science and Engineering Saveetha Institute of Medical and Technical Sciences Chennai India

ISBN: (纸本)9798350355468

The proposed model articulated in this paper is a future mode of automated sorting of green coffee bean image with vision processing and machine learning. The presentations in the algorithm basically exploit visual characteristics of the bean, mainly characterized according to color, morphology, shape and size, in order to sort it using the kNN method. The entire method encapsulates capturing the images/source data-processing-feature extraction-classification. Essential image processing techniques include noise reduction, segmentation and others, to characterize and quantify necessary attributes of the bean. All characteristics will be feeding into the kNN classifier that determines granule quality and defect definition. MATLAB and Arduino-software in real-time decision making. Experimental mistakes of the whole system demonstrate that it has an improvement in the accuracy in identifying defects and quality assessment over conventional human inspection methods. The same model could increase efficiency, labor cost, and raise the entire quality control of procedure in the coffee field. © 2025 IEEE.

关键词： Arduino Mega Board Coffee Beans Image Pattern Recognition k-nearest algorithm Machine Learning

来源：评论

学校读者我要写书评

暂无评论

LANDMARC with Improved k-nearest algorithm for RFID Location System 2

LANDMARC with Improved <i>k</i>-Nearest Algorithm for RFID L...

引用

2nd IEEE International Conference on Computer and Communications (ICCC)

作者： Liu, Xing Wen, Meng Qin, Guangcheng Liu, Rong PLA Univ Sci & Technol Inst Commun Nanjing Jiangsu Peoples R China Inst China Elect Syst Engn Corp Beijing Peoples R China

ISBN: (纸本)9781467390262

The RFID (Radio Frequency Identification) localization technology has become one of the most developed technologies owing to its low cost, full-fledged application and flexible deployment. However, current RFID localization system cannot achieve the task of precise and highly accurate object localization due to the limitations of localization algorithm. Traditionally, the localization algorithm cannot make the localization more accuracy. The demand to improve the localization precision is still growing dramatically. LANDMARC system is a typical case that uses virtual tag to improve the overall accuracy of locating moving objects. However, this overall accuracy is fluctuates due to the multipath effect and the various indoor environment. This research work attempts to improve localization precision by using the sensing information network coordination and the log-distance path loss model. From the results, this approach can deliver a localization precision.

关键词： RFID LANDMARC localization k-nearest algorithm

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Various Machine Learning Techniques for Parkinson Disease Detection Based on Handwriting 1

引用

4th Congress on Intelligent Systems (CIS)

作者： Singh, Gurpreet Sharma, Sukesha Panjab Univ UIET Chandigarh India

ISBN: (数字)9789819990405

ISBN: (纸本)9789819990399;9789819990405

The most prevalent neurodegenerative condition that substantially impairs elderly people's motor capabilities is Parkinson's disease (PD). Even today, in less developed regions of the world, the diagnosis and monitoring of PD remain an expensive and difficult process. This is comparative study of methods for predicting Parkinson's disease using hand-drawn spiral pictures using computer vision and machine learning approaches. In this paper, five machine learning algorithms are used, which are Decision Tree, k-nearest Neighbors, Support Vector Classifier, Logistic Regression, and Random Forest. Along with this, HOG feature descriptor is used for the extraction of the features from the spiral images. In this work, the kNN machine learning algorithm performed with the best accuracy of 90%. Similarly, the Random Forest is the second best algorithm with accuracy 83.3%.

关键词： Parkinson's disease Machine learning Spiral images Hog algorithm k-nearest algorithm Logistic regression

来源：评论

学校读者我要写书评

暂无评论

ADVANCED LANDMARC WITH ADAPTIVE k-nearest algorithm FOR RFID LOCATION SYSTEM

ADVANCED LANDMARC WITH ADAPTIVE k-NEAREST ALGORITHM FOR RFID...

引用

2010 2nd IEEE International Conference on Network Infrasturcture & Digital Content(2010年第二届IEEE网络基础设施与数字内容国际会议 IC-NIDC 2010)

作者： kyuwon Han Sung Ho Cho Division of Electrical and Computer Engineering Hanyang University Seoul Korea

This paper proposed advanced LANDMARC with adaptive k-nearest neighbor algorithm for RFID location system. LANDMARC was based on Received Signal Strength (RSS). It sometimes showed bad performance for fluctuation. Therefore, adaptive k-nearest neighbor algorithm was introduced for improving accuracy and was applied to original LANDMARC. In our simulation, we showed that the proposed method can achieve a better performance for location sensing.

关键词： RFID LANDMARC Location Sensing k-nearest algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：