Apply rough set theory into the web services composition

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

5 Citations (Scopus)

Abstract

Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite web services, known as web services compositions. Web services compositions are synthesized by researchers from elementary web services, offering the opportunity for service providers and application developers to create value-added services, through web services composition. However, a problem exists in the current distribution process of web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic Algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of web services).

Original languageEnglish
Title of host publicationProceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008
Pages888-895
Number of pages8
DOIs
Publication statusPublished - 2008 Sep 1
Event22nd International Conference on Advanced Information Networking and Applications, AINA 2008 - Gino-wan, Okinawa, Japan
Duration: 2008 Mar 252008 Mar 28

Other

Other22nd International Conference on Advanced Information Networking and Applications, AINA 2008
CountryJapan
CityGino-wan, Okinawa
Period08-03-2508-03-28

Fingerprint

Rough set theory
Web services
Chemical analysis
Genetic algorithms
Large scale systems
Composite materials

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Liang, W. Y. (2008). Apply rough set theory into the web services composition. In Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008 (pp. 888-895). [4482800] https://doi.org/10.1109/AINA.2008.52
Liang, Wen Yau. / Apply rough set theory into the web services composition. Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008. 2008. pp. 888-895
@inproceedings{bf50da4d84834d5ab508134e08ff749e,
title = "Apply rough set theory into the web services composition",
abstract = "Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite web services, known as web services compositions. Web services compositions are synthesized by researchers from elementary web services, offering the opportunity for service providers and application developers to create value-added services, through web services composition. However, a problem exists in the current distribution process of web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic Algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of web services).",
author = "Liang, {Wen Yau}",
year = "2008",
month = "9",
day = "1",
doi = "10.1109/AINA.2008.52",
language = "English",
isbn = "0769530958",
pages = "888--895",
booktitle = "Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008",

}

Liang, WY 2008, Apply rough set theory into the web services composition. in Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008., 4482800, pp. 888-895, 22nd International Conference on Advanced Information Networking and Applications, AINA 2008, Gino-wan, Okinawa, Japan, 08-03-25. https://doi.org/10.1109/AINA.2008.52

Apply rough set theory into the web services composition. / Liang, Wen Yau.

Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008. 2008. p. 888-895 4482800.

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

TY - GEN

T1 - Apply rough set theory into the web services composition

AU - Liang, Wen Yau

PY - 2008/9/1

Y1 - 2008/9/1

N2 - Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite web services, known as web services compositions. Web services compositions are synthesized by researchers from elementary web services, offering the opportunity for service providers and application developers to create value-added services, through web services composition. However, a problem exists in the current distribution process of web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic Algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of web services).

AB - Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite web services, known as web services compositions. Web services compositions are synthesized by researchers from elementary web services, offering the opportunity for service providers and application developers to create value-added services, through web services composition. However, a problem exists in the current distribution process of web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic Algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of web services).

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

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

U2 - 10.1109/AINA.2008.52

DO - 10.1109/AINA.2008.52

M3 - Conference contribution

AN - SCOPUS:50249159588

SN - 0769530958

SN - 9780769530956

SP - 888

EP - 895

BT - Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008

ER -

Liang WY. Apply rough set theory into the web services composition. In Proceedings - 22nd International Conference on Advanced Information Networking and Applications, AINA 2008. 2008. p. 888-895. 4482800 https://doi.org/10.1109/AINA.2008.52