A New Query Method Based on Distance Education Database

DOI

10.2991/emim-16.2016.133How to use a DOI?

Keywords

Traditional and optimize; Query method; Distance learning; Database

Abstract

In recent years, number of web-based distance learning system has rapidly increased as a result of improvements in the internet. According to the data of different characteristics of the data query optimization will be divided into different categories of data. Through the traditional and optimize two aspects of the distance learning system, using database query way to do an analysis. And I will use the form of the graphic about the study to do a presentation to express my leaning about distance learning database. Typical of distance learning database as follows: query method, the first, database query method based on wheel sequence: From start to finish, then to a circle. And so on, querying a database by this way next time .The second, database query method based on spectral clustering algorithm: The definition of a description of paired data points of similarity affinity matrix, and the calculation of matrix eigenvalue and eigenvector, and then select the appropriate clustering feature vectors of different data points according to the given sample data set. The third, Database query method based on K mean: Given a collection of data points and the number of clustering K, K by the user specified, K mean algorithm based on a distance function repeatedly into k clustering of data.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wenxuan Gu
AU  - Cao Yuan
PY  - 2016/04
DA  - 2016/04
TI  - A New Query Method Based on Distance Education Database
BT  - Proceedings of the 6th International Conference on Electronic, Mechanical, Information and Management Society
PB  - Atlantis Press
SP  - 637
EP  - 641
SN  - 2352-538X
UR  - https://doi.org/10.2991/emim-16.2016.133
DO  - 10.2991/emim-16.2016.133
ID  - Gu2016/04
ER  -