Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Directory of Open Access Journals (DOAJ) |
|---|---|
| Author | D. G. Huang L. Guo H. Y. Yang X. P. Wei B. Jin |
| Abstract | At the present time, only large multinational pharmaceutical companies have the financial ability to research new drugs. Thus, reducing the research and development costs of new drugs is an important subject. Through the in-depth mining of existing drug data, this paper aims to classify unknown drugs and provide assistance for drug screening during the development process. This will reduce the costs of original drug research and promote the transformation of China's pharmaceutical industry. In this paper, we first collected a drug data set using a Web crawler. Based on this data set, we derived a formula for calculating the similarity between drugs and identified the parameters of the similarity calculation formula from a subset of the data. We used the k-nearest neighbor classifier to categorize the drug data based on the similarity of medicines. The results show that the proposed drug classification model can achieve 77.7% accuracy, which is far better than the classification performance of a decision tree and a random forest with only one decision tree, similar to that of a random forest with 10 decision trees, and worse than that of a random forest with 500 decision trees. Although the classification method proposed in this paper is reasonable and the experimental results are in line with expectations, the proposed technique could be improved to manage problems, such as overfitting. Because this classification method is based on chemical similarity and depends entirely on the available training data (which are limited), such fitting problems are inevitable. To solve this problem, more data are needed and the existing sampling method should be improved. One possible approach is to combine this algorithm with ensemble learning techniques to avoid the phenomenon of overfitting. |
| e-ISSN | 21693536 |
| DOI | 10.1109/ACCESS.2017.2654062 |
| Journal | IEEE Access |
| Volume Number | 5 |
| Language | English |
| Publisher | IEEE |
| Publisher Date | 2017-01-01 |
| Publisher Place | United States |
| Access Restriction | Open |
| Subject Keyword | Electrical Engineering. Electronics. Nuclear Engineering Chemical Medicine Classification Similarity Between Medicines Data Mining |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|