Dòng Nội dung
1
A gorithm to build fuzzuy decision tree for data classification problem based on fuzziness intervals matching / Le Van Tuong Lan, Nguyen Mau Han, Nguyen Cong Hao // Tạp chí Tin học và Điều khiển học . - 2016. - P. 367-380. - ISSN:


14 p.
Ký hiệu phân loại (DDC): 512
In this paper using fuzziness intervals matching with hedge algebra, the authors proposed an inductive learning method to obtain a fuzzy decision tree with high predictability
Số bản sách: (0) Tài liệu số: (1)
2
A Method Of Semantic—Based Image Retrieval Using Graph Cut / Nguyen Minh Hai, Van The Thanh, Tran Van Lang // Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics . - 2022. - tr. 91-110. - ISSN: 1813-9663



Ký hiệu phân loại (DDC): 005.74
Semantic extraction from images is a topical problem and is applied in many different semantic retrieval systems. In this paper, a method of image semantic retrieval is proposed based on a set of images similar to the input image. Since then, the semantics of the image are queried on the ontology by the visual word vector. The objects in each image are classified and features extracted based on Mask R—CNN, then stored on a graph cut to extract semantics from the image. For each image query, a similar set of images is retrieved on the graph cut and then a set of the visual words is extracted based on the classes obtained from Mask R—CNN, as the basis for querying semantics of an input image on ontology by SPARQL query. On the basis of the proposed method, an experiment was built and evaluated on the image datasets MIRFLICKR—QSK and MS COCO.
Số bản sách: (0) Tài liệu số: (1)
3
A reformed K-Nearest neighbors algorithm for big data sets / Vo Ngoc Phu, Vo Thi Ngoc Tran // Journal of Computer Science. - . - Vol. 14, Issue 9, P.1213-1225. - ISSN:

New York : Science Publications, 2018
13 p.
Ký hiệu phân loại (DDC): 004
A Data Mining Has Already Had Many Algorithms Which A K-Nearest Neighbors Algorithm, K-NN, Is A Famous Algorithm For Researchers. K-NN Is Very Effective On Small Data Sets, However It Takes A Lot Of Time To Run On Big Datasets. Today, Data Sets Often Have Millions Of Data Records, Hence, It Is Difficult To Implement K-NN On Big Data. In This Research, We Propose An Improvement To K-NN To Process Big Datasets In A Shortened Execution Time. The Reformed K-Nearest Neighbors Algorithm (R-K-NN) Can Be Implemented On Large Datasets With Millions Or Even Billions Of Data Records. R-K-NN Is Tested On A Data Set With 500,000 Records. The Execution Time Of R-K-NN Is Much Shorter Than That Of K-NN. In Addition, R-K-NN Is Implemented In A Parallel Network System With Hadoop Map (M) And Hadoop Reduce (R).
Số bản sách: (0) Tài liệu số: (1)
4
An introduction to data science / Jeffrey S. Saltz, Jeffrey M. Stanton
Thousand Oaks, California : SAGE Publications, Inc, 2018
168 p.
Ký hiệu phân loại (DDC): 005.74
Số bản sách: (0) Tài liệu số: (0)
5
An Introduction to Machine Learning / Miroslav Kubat
Cham : Springer, 2017
348 p. ; cm.
Ký hiệu phân loại (DDC): 006.3
This textbook presents fundamental machine learning concepts in an easy to understand manner by providing practical advice, using straightforward examples, and offering engaging discussions of relevant applications. The main topics include Bayesian classifiers, nearest-neighbor classifiers, linear and polynomial classifiers, decision trees, neural networks, and support vector machines. Later chapters show how to combine these simple tools by way of "boosting," how to exploit them in more complicated domains, and how to deal with diverse advanced practical issues. One chapter is dedicated to the popular genetic algorithms. This revised edition contains three entirely new chapters on critical topics regarding the pragmatic application of machine learning in industry. The chapters examine multi-label domains, unsupervised learning and its use in deep learning, and logical approaches to induction as well as Inductive Logic Programming. Numerous chapters have been expanded, and the presentation of the material has been enhanced. The book contains many new exercises, numerous solved examples, thought-provoking experiments, and computer assignments for independent work.
Số bản sách: (0) Tài liệu số: (1)