<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">sarang sukumar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering web services based on multi-criteria service dominance relationship using Peano Space filling curve</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE ICDSE </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&amp;arnumber=6282302&amp;contentType=Conference+Publications&amp;refinements%3D4293828225%2C4293671495%26queryText%3Dicdse</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://people.cse.nitc.ac.in/sites/default/files/sarangsukumar/files/06282302.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">CUSAT</style></pub-location><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Abstract - As the use of the web is greatly increased so as&lt;br /&gt;
the need for effective web service selection and retrieval&lt;br /&gt;
techniques. So many good algorithms have been&lt;br /&gt;
developed for web service selection problem. The need&lt;br /&gt;
for effective web service clustering technique is also&lt;br /&gt;
came forward, which will help the users to search&lt;br /&gt;
within their needed clusters, that will reflect different&lt;br /&gt;
tradeoffs such as price , quality etc. Recent works on&lt;br /&gt;
web service selection and retrieval techniques has found&lt;br /&gt;
out that for getting greater accuracy and stability, all&lt;br /&gt;
the algorithms for web service selection and clustering&lt;br /&gt;
must satisfy the following two criteria. First, it should&lt;br /&gt;
consider all the parameter matches. Second, multiple&lt;br /&gt;
criteria should be taken into consideration while&lt;br /&gt;
performing the parameter matching. In this paper we&lt;br /&gt;
are proposing an efficient web service clustering&lt;br /&gt;
technique based on multi criteria service dominance&lt;br /&gt;
relationship, which satisfies the above criteria. Recent&lt;br /&gt;
work on the same area proposed the use of Hilbert&lt;br /&gt;
space filling curve, and then applying a simple&lt;br /&gt;
algorithm for forming the clusters. Space filling curve is&lt;br /&gt;
a way of mapping multi-dimensional space into the one&lt;br /&gt;
dimensional space. So the effectiveness of the formed&lt;br /&gt;
clusters are having a direct relationship with how&lt;br /&gt;
effective the used space filling curve is. In this paper we&lt;br /&gt;
propose the use of Peano Space filling curve for the&lt;br /&gt;
multidimensional reduction, which tends to show less&lt;br /&gt;
irregularity, more fairness and more scalability than&lt;br /&gt;
Hilbert space filling curve.&lt;/p&gt;
</style></abstract></record></records></xml>