This book is concerned with the study and analysis of search engines and page rank algorithm in semantic space. Several search engines have been proposed, which allow increasing information retrieval accuracy by exploiting a key content of semantic web resources, ie relations. However, in order to rank results, most of the existing solutions need to work on the whole annotated knowledge base.The proposed case and relation based page rank algorithm is designed based on query definition process using ontological relations. The proposed architecture uses a hybrid methodology named case and relation based page rank algorithm which uses past problem solving experience maintained in the case based rank algorithm to form a best matching relations. This proposed approach reduces the search time by avoiding the generation of annotated page graphs for irrelevant results.In this work, a novel ranking strategy is proposed with the capability of fetching the results which are relevant to the user query by using the previous knowledge of search and providing a relevant score for the result pages by considering the user query, the page annotation and the underlying ontology.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is concerned with the study and analysis of search engines and page rank algorithm in semantic space. Several search engines have been proposed, which allow increasing information retrieval accuracy by exploiting a key content of semantic web resources, ie relations. However, in order to rank results, most of the existing solutions need to work on the whole annotated knowledge base.The proposed case and relation based page rank algorithm is designed based on query definition process using ontological relations. The proposed architecture uses a hybrid methodology named case and relation based page rank algorithm which uses past problem solving experience maintained in the case based rank algorithm to form a best matching relations. This proposed approach reduces the search time by avoiding the generation of annotated page graphs for irrelevant results.In this work, a novel ranking strategy is proposed with the capability of fetching the results which are relevant to the user query by using the previous knowledge of search and providing a relevant score for the result pages by considering the user query, the page annotation and the underlying ontology. 168 pp. Englisch. N° de réf. du vendeur 9783659341144
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 158871176
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Case And Relation(CARE) Based Page Rank Algorithm In Semantic Space | Preethi Nanjundan | Taschenbuch | 168 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659341144 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 104116712
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is concerned with the study and analysis of search engines and page rank algorithm in semantic space. Several search engines have been proposed, which allow increasing information retrieval accuracy by exploiting a key content of semantic web resources, ie relations. However, in order to rank results, most of the existing solutions need to work on the whole annotated knowledge base.The proposed case and relation based page rank algorithm is designed based on query definition process using ontological relations. The proposed architecture uses a hybrid methodology named case and relation based page rank algorithm which uses past problem solving experience maintained in the case based rank algorithm to form a best matching relations. This proposed approach reduces the search time by avoiding the generation of annotated page graphs for irrelevant results.In this work, a novel ranking strategy is proposed with the capability of fetching the results which are relevant to the user query by using the previous knowledge of search and providing a relevant score for the result pages by considering the user query, the page annotation and the underlying ontology.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 168 pp. Englisch. N° de réf. du vendeur 9783659341144
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is concerned with the study and analysis of search engines and page rank algorithm in semantic space. Several search engines have been proposed, which allow increasing information retrieval accuracy by exploiting a key content of semantic web resources, ie relations. However, in order to rank results, most of the existing solutions need to work on the whole annotated knowledge base.The proposed case and relation based page rank algorithm is designed based on query definition process using ontological relations. The proposed architecture uses a hybrid methodology named case and relation based page rank algorithm which uses past problem solving experience maintained in the case based rank algorithm to form a best matching relations. This proposed approach reduces the search time by avoiding the generation of annotated page graphs for irrelevant results.In this work, a novel ranking strategy is proposed with the capability of fetching the results which are relevant to the user query by using the previous knowledge of search and providing a relevant score for the result pages by considering the user query, the page annotation and the underlying ontology. N° de réf. du vendeur 9783659341144
Quantité disponible : 1 disponible(s)