Search Results (1 to 9 of 9 Results)
Download search results: CSV END BibTex RIS
Skip search results from other journals and go to results- 2 JMIR AI
- 2 JMIR Perioperative Medicine
- 2 JMIR mHealth and uHealth
- 1 JMIR Cancer
- 1 JMIR Formative Research
- 1 Journal of Medical Internet Research
- 0 Medicine 2.0
- 0 Interactive Journal of Medical Research
- 0 iProceedings
- 0 JMIR Research Protocols
- 0 JMIR Human Factors
- 0 JMIR Medical Informatics
- 0 JMIR Public Health and Surveillance
- 0 JMIR Serious Games
- 0 JMIR Mental Health
- 0 JMIR Rehabilitation and Assistive Technologies
- 0 JMIR Preprints
- 0 JMIR Bioinformatics and Biotechnology
- 0 JMIR Medical Education
- 0 JMIR Challenges
- 0 JMIR Diabetes
- 0 JMIR Biomedical Engineering
- 0 JMIR Data
- 0 JMIR Cardio
- 0 Journal of Participatory Medicine
- 0 JMIR Dermatology
- 0 JMIR Pediatrics and Parenting
- 0 JMIR Aging
- 0 JMIR Nursing
- 0 JMIRx Med
- 0 JMIRx Bio
- 0 JMIR Infodemiology
- 0 Transfer Hub (manuscript eXchange)
- 0 JMIR Neurotechnology
- 0 Asian/Pacific Island Nursing Journal
- 0 Online Journal of Public Health Informatics
- 0 JMIR XR and Spatial Computing (JMXR)
Go back to the top of the page Skip and go to footer section

Other methods such as multiple interpolations and Expectation-Maximization estimation introduce cross-correlation between features, and regression estimation and k-nearest neighbor increase auto-correlation of a single sensor feature [35,36]. However, the moving average method is sensitive to the number of continuous missing data. If the missing block is large, the moving average will introduce high noise and bias, and the data may need to be removed instead of imputed.
JMIR AI 2024;3:e47194
Download Citation: END BibTex RIS
Go back to the top of the page Skip and go to footer section
Go back to the top of the page Skip and go to footer section

We evaluated a number of different binary classifiers, including logistic regression, k-nearest neighbors, support vector machine, random forest, gradient boosting, extreme gradient boosting, and Light GBM.
JMIR Cancer 2021;7(2):e27975
Download Citation: END BibTex RIS
Go back to the top of the page Skip and go to footer section
Go back to the top of the page Skip and go to footer section

Unlike other clustering algorithms, such as k-means, DBSCAN does not require knowing the number of clusters a priori. It is able to find inner clusters (clusters surrounded by other clusters) and is robust to outliers and noise. Global clusters were extracted using all data and local clusters were extracted when data were split into daily time segments described earlier.
JMIR Mhealth Uhealth 2019;7(7):e13209
Download Citation: END BibTex RIS

Estimation of Symptom Severity During Chemotherapy From Passively Sensed Data: Exploratory Study
J Med Internet Res 2017;19(12):e420
Download Citation: END BibTex RIS