Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Kwangman Ko

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Khubaib Amjad Alam

> Home > Persons > Kwangman Ko

Publications

2020
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/fuzzIEEE/AbbasAK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fuzzIEEE/AbbasAK20
Syed Manzar Abbas, Khubaib Amjad Alam, Kwang-Man Ko:
A Three-way Classification with Game-theoretic N-Soft Sets for Handling Missing Ratings in Context-aware Recommender Systems. FUZZ-IEEE 2020: 1-8
2018
[c14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/ant/AlamABKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ant/AlamABKK18
Khubaib Amjad Alam, Rodina Ahmed, Faisal Shafique Butt, Soon-Gohn Kim, Kwang-Man Ko:
An Uncertainty-aware Integrated Fuzzy AHP-WASPAS Model to Evaluate Public Cloud Computing Services. ANT/SEIT 2018: 504-509
2017
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/AlamAK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/AlamAK17
Khubaib Amjad Alam, Rodina Binti Ahmad, Kwangman Ko:
Enabling Far-Edge Analytics: Performance Profiling of Frequent Pattern Mining Algorithms. IEEE Access 5: 8236-8249 (2017)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.