Analysing the density of subgroups in valued relationships based on DNA computing

Ikno Kim, Don Jyh Fu Jeng, Junzo Watada

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees' close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages964-971
    Number of pages8
    Volume4253 LNAI - III
    Publication statusPublished - 2006
    Event10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006 - Bournemouth
    Duration: 2006 Oct 92006 Oct 11

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume4253 LNAI - III
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006
    CityBournemouth
    Period06/10/906/10/11

    Fingerprint

    DNA Computing
    DNA
    Subgroup
    Personnel
    Molecular Computers
    Quality of Life
    Human Resource Management
    Maximum Clique
    Human Resources
    Information Dissemination
    Rearrangement
    Workplace
    Sharing
    NP-complete problem
    Organizations
    Term
    Relationships
    Human resource management
    Life
    Industry

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Kim, I., Jeng, D. J. F., & Watada, J. (2006). Analysing the density of subgroups in valued relationships based on DNA computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4253 LNAI - III, pp. 964-971). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4253 LNAI - III).

    Analysing the density of subgroups in valued relationships based on DNA computing. / Kim, Ikno; Jeng, Don Jyh Fu; Watada, Junzo.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III 2006. p. 964-971 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4253 LNAI - III).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kim, I, Jeng, DJF & Watada, J 2006, Analysing the density of subgroups in valued relationships based on DNA computing. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4253 LNAI - III, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4253 LNAI - III, pp. 964-971, 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006, Bournemouth, 06/10/9.
    Kim I, Jeng DJF, Watada J. Analysing the density of subgroups in valued relationships based on DNA computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III. 2006. p. 964-971. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Kim, Ikno ; Jeng, Don Jyh Fu ; Watada, Junzo. / Analysing the density of subgroups in valued relationships based on DNA computing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III 2006. pp. 964-971 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{2251f36a99fb49ea81533f956bf085fb,
    title = "Analysing the density of subgroups in valued relationships based on DNA computing",
    abstract = "One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees' close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.",
    author = "Ikno Kim and Jeng, {Don Jyh Fu} and Junzo Watada",
    year = "2006",
    language = "English",
    isbn = "3540465421",
    volume = "4253 LNAI - III",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "964--971",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Analysing the density of subgroups in valued relationships based on DNA computing

    AU - Kim, Ikno

    AU - Jeng, Don Jyh Fu

    AU - Watada, Junzo

    PY - 2006

    Y1 - 2006

    N2 - One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees' close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.

    AB - One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees' close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.

    UR - http://www.scopus.com/inward/record.url?scp=33750699358&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33750699358&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 3540465421

    SN - 9783540465423

    VL - 4253 LNAI - III

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 964

    EP - 971

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -