Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces

Ragone, Azzurra; Straccia, Umberto; Noia, Tommaso Di; Sciascio, Eugenio Di; Donini, Francesco M.

doi:10.1007/978-3-540-72667-8_30

Cited by 23 publications

(24 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the precise use case motivating particular approaches to SWS is often not clearly identified. To identify the main objectives motivating SWS, we performed a review of published work with detailed and specific descriptions of envisioned use-cases [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26]. While this review is clearly not exhaustive, we believe that it is representative for the majority of SWS projects.…”

Section: Criteria Analysismentioning

confidence: 99%

“…Typical scenarios of this type involve the discovery of the best deal to purchase a set of items (e.g. books [17], furniture [18], computers [19,20], or used cars [21]), to find the best matching offer in an appartment rental scenario [22], or to make travel arrangements and flight or hotel bookings [23].…”

Section: Criteria Analysismentioning

confidence: 99%

“…If required, does the framework work under the requirements of P2P environments or the limited resources of mobile devices? Goal 2 Minimize the cost or optimize the quality of a consumed functionality by dynamically reacting to changes in the service landscape [12][13][14][15][16][17][18][19][20][21][22][23][24]26]. [12, 13, 15-17, 24, 25].…”

Section: Goalmentioning

confidence: 99%

See 2 more Smart Citations

On the Evaluation of Semantic Web Service Frameworks

Küster

König‐Ries

Petrie

et al. 2008

International Journal on Semantic Web and Information Systems

View full text Add to dashboard Cite

In recent years, a huge amount of research effort and funding has been devoted to the area of Semantic Web services (SWS). This has resulted in the proposal of numerous competing approaches to facilitate the automation of mediation, choreography, and discovery for Web services using semantic annotations. However, despite a wealth of theoretical work, too little effort has been spent toward the comparative experimental evaluation of the competing approaches so far. Progress in scientific development and industrial adoption is thereby hindered. An established evaluation methodology and standard benchmarks that allow the comparative evaluation of different frameworks are thus needed for the further advancement of the field. To this end, a criteria model for SWS evaluation is presented, and the existing approaches toward SWS evaluation are comprehensively analyzed. Their shortcomings are discussed in order to identify the fundamental issues of SWS evaluation. Based on this discussion, a research agenda toward agreed upon evaluation methodologies is proposed.

show abstract

Section: Criteria Analysismentioning

confidence: 99%

Section: Criteria Analysismentioning

confidence: 99%

See 1 more Smart Citation

On the Evaluation of Semantic Web Service Frameworks

Küster

König‐Ries

Petrie

et al. 2008

International Journal on Semantic Web and Information Systems

View full text Add to dashboard Cite

show abstract

“…The type of a constraint plays an important role in the determination of an overall distance of a candidate profile from a centroid profile. Whereas, in Ragone et al [12] matchmaking system constraints are split into strict requirements (hard constraints) and preferences (soft constraints). Participants have to assign utility values to soft constraints, which are used while computing the matchmaking score.…”

Section: Introductionmentioning

confidence: 99%

Compromise Matching in P2P e-Marketplaces: Concept, Algorithm and Use Case

Joshi

Bhavsar

Boley

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Vous avez des questions? Nous pouvons vous aider. Pour communiquer directement avec un auteur, consultez la première page de la revue dans laquelle son article a été publié afin de trouver ses coordonnées. Si vous n'arrivez pas à les repérer, communiquez avec nous à PublicationsArchive-ArchivesPublications@nrc-cnrc.gc.ca. NRC Publications Record / Notice d'Archives des publications de CNRC:http://nparc.cisti-icist.nrc-cnrc.gc.ca/eng/view/object/?id=829f2634-0b9d-47b4-a02a-2ca57f86af85 http://nparc.cisti-icist.nrc-cnrc.gc.ca/fra/voir/objet/?id=829f2634-0b9d-47b4-a02a-2ca57f86af85Compromise Matching in P2P e-Marketplaces:Concept, Algorithm and Use Case Abstract. A basic component of automated matchmaking is the automatic generation of a ranked list of profiles matching with the profiles of a given participant. Identifying and ranking of matching profiles among thousands of candidate profiles is a challenging task. In order to determine the degree of matching between two profiles, corresponding pairs of constraints are compared and aggregated to the overall similarity between the two profiles. This paper describes the structure and algorithm of a proposed matchmaking system with a focus on the central notion of compromise match. A compromise match is called for when either one or both constraints within a pair are soft and moreover their values do not match exactly. Two important aspects of compromise matching are discussed, namely compromise count factor, compromise count reduction factor; furthermore their effect on ranking is described. A use case with a sample set of home rental profiles from an existing e-marketplace is employed for demonstration.

show abstract

“…The information need of a user, however, very often involves so-called vague predicates. For instance, in a logic-based e-commerce process, we may ask "find a car costing around $15000" (see [12]); or in ontology-mediated access to multimedia information, we may ask "find images about cars, which are similar to a given one" (see, e.g., [11,19]). Unlike the classical case, tuples now satisfy these queries to a degree (usually in [0,1]).…”

Section: Introductionmentioning

confidence: 99%