- Volume 13 Number 1 ( Feb. 2023)
- Volume 13 Number 2 ( April. 2023)
- Volume 13 Number 3 (Jun. 2023)
- Volume 13 Number 4 (Aug. 2023)
- Volume 13 Number 5 ( Oct. 2023)
- Volume 13 Number 6 ( Dec. 2023)
- Volume 12 Number 1 ( Feb. 2022)
- Volume 12 Number 2 ( May. 2022)
- Volume 12 Number 3 (Aug. 2022)
- Volume 12 Number 4 ( Nov. 2022)
- Volume 11 Number 1 ( Feb. 2021)
- Volume 11 Number 2 ( May. 2021)
- Volume 11 Number 3 (Aug. 2021)
- Volume 11 Number 4 ( Nov. 2021)
- Volume 10 Number 1 ( Feb. 2020)
- Volume 10 Number 2 ( May. 2020)
- Volume 10 Number 3 (Aug. 2020)
- Volume 10 Number 4 ( Nov. 2020)
- Volume 9 Number 1 ( Feb. 2019)
- Volume 9 Number 2 ( May. 2019)
- Volume 9 Number 3 ( Aug. 2019)
- Volume 9 Number 4 ( Nov. 2019)
- Volume 8 Number 1 ( Jan. 2018)
- Volume 8 Number 2 (Feb. 2018)
- Volume 8 Number 3 (Mar. 2018)
- Volume 8 Number 4 (Apr. 2018)
- Volume 8 Number 5 (May. 2018)
- Volume 8 Number 6 (Jun. 2018)
- Volume 8 Number 7 (Jul. 2018)
- Volume 8 Number 8 (Aug. 2018)
- Volume 8 Number 9 (Sep. 2018)
- Volume 8 Number 10 (Oct. 2018)
- Volume 8 Number 11 (Nov. 2018)
- Volume 8 Number 12 (Dec. 2018)
- Volume 7 Number 1 (Jan. 2017)
- Volume 7 Number 2 (Feb. 2017)
- Volume 7 Number 3 (Mar. 2017)
- Volume 7 Number 4 (April. 2017)
- Volume 7 Number 5 (May. 2017)
- Volume 7 Number 6 (Jun. 2017)
- Volume 7 Number 7 (Jul. 2017)
- Volume 7 Number 8 (Aug. 2017)
- Volume 7 Number 9 (Sep. 2017)
- Volume 7 Number 10 ( Oct. 2017)
- Volume 7 Number 11 ( Nov. 2017)
- Volume 7 Number 12 ( Dec. 2017)
- Volume 6 Number 1 (Jan. 2016)
- Volume 6 Number 2 (Feb. 2016)
- Volume 6 Number 3 (Mar. 2016)
- Volume 6 Number 4 (Apr. 2016)
- Volume 6 Number 5 (May 2016)
- Volume 6 Number 6 (Jun. 2016)
- Volume 6 Number 7 (Jul. 2016)
- Volume 6 Number 8 (Aug. 2016)
- Volume 6 Number 9 (Sep. 2016)
- Volume 6 Number 10 (Oct. 2016)
- Volume 6 Number 11 (Nov. 2016)
- Volume 6 Number 12 (Dec. 2016)
- Volume 5 Number 1 (Jan. 2015)
- Volume 5 Number 2 (Feb. 2015)
- Volume 5 Number 3 (Mar. 2015)
- Volume 5 Number 4 (Apr. 2015)
- Volume 5 Number 5 (May 2015)
- Volume 5 Number 6 (Jun. 2015)
- Volume 5 Number 7 (Jul. 2015)
- Volume 5 Number 8 (Aug. 2015)
- Volume 5 Number 9 (Sep. 2015)
- Volume 5 Number 10 (Oct. 2015)
- Volume 5 Number 11 (Nov. 2015)
- Volume 5 Number 12 (Dec. 2015)
- Volume 4 Number 1 (Jan. 2014)
- Volume 4 Number 2 (Mar. 2014)
- Volume 4 Number 3 (May 2014)
- Volume 4 Number 4 (Jul. 2014)
- Volume 4 Number 5 (Sep. 2014)
- Volume 4 Number 6 (Nov. 2014)
- Volume 3 Number 1 (Jan. 2013)
- Volume 3 Number 2 (Mar. 2013)
- Volume 3 Number 3 (May 2013)
- Volume 3 Number 4 (Jul. 2013)
- Volume 3 Number 5 (Sep. 2013)
- Volume 3 Number 6 (Nov. 2013)
- Volume 2 Number 1 (Jan. 2012)
- Volume 2 Number 2 (Mar. 2012)
- Volume 2 Number 3 (May 2012)
- Volume 2 Number 4 (Jul. 2012)
- Volume 2 Number 5 (Sep. 2012)
- Volume 2 Number 6 (Nov. 2012)
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
- ISSN: 2010-3646 (Online)
- Abbreviated Title: Int. J. Social. Scienc. Humanit.
- Frequency: Bimonthly
- DOI: 10.18178/IJSSH
- Editor-in-Chief: Prof. Paul Sudnik
- Executive Editor: Ms. Yoyo Y. Zhou
- Abstracting/ Indexing: Google Scholar, Index Copernicus, Crossref, Electronic Journals Library
- E-mail: ijssh.editorial.office@gmail.com
Home> Archive> 2016> Volume 6 Number 9 (Sep. 2016)
IJSSH 2016 Vol.6(9): 706-709 ISSN: 2010-3646
doi: 10.18178/ijssh.2016.6.9.736
doi: 10.18178/ijssh.2016.6.9.736
A Study on Sports Data Matching for Virtual Competitions
Kai-Li Wang and Kai-Chun Wang
Abstract—Technological advances have given rise to increasingly diverse sports data and applications. Among them, integrated sensors, big data and cloud computing are the most intriguing ones. Their combination with social media enables users to share their sports data, expanding their network. In this study, we will go through a screening analysis model that employed advanced mathematics, and derive our solution through the approximation theory. Our goal is to find a more accurate matching model for users of a big sports database to join a virtual competition. Compared with traditional sports rating methods, our desired model can more flexibly match each piece of sports data in a practical manner.
Index Terms—Sports data matching, screening analysis, approximation theory, virtual competition.
K. L. Wang is with the National Taiwan Sport University, Taoyuan City, Taiwan 33301 ROC (e-mail: elverz@ms8.hinet.net).
K. C. Wang was with Fu Jen Catholic University, New Taipei City, Taiwan 24205 ROC. He is now with the Commerce Development Research Institute, Taipei City, Taiwan 10665 ROC (e-mail: kennyynnek123@gmail.com).
Index Terms—Sports data matching, screening analysis, approximation theory, virtual competition.
K. L. Wang is with the National Taiwan Sport University, Taoyuan City, Taiwan 33301 ROC (e-mail: elverz@ms8.hinet.net).
K. C. Wang was with Fu Jen Catholic University, New Taipei City, Taiwan 24205 ROC. He is now with the Commerce Development Research Institute, Taipei City, Taiwan 10665 ROC (e-mail: kennyynnek123@gmail.com).
Cite: Kai-Li Wang and Kai-Chun Wang, "A Study on Sports Data Matching for Virtual Competitions," International Journal of Social Science and Humanity vol. 6, no. 9, pp. 706-709, 2016.