32 Hits in 2.1 sec


Kemafor Anyanwu, Angela Maduko, Amit Sheth
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently gained some ground, the  ...  their search modes to effect changes in the ordering of results depending on their need.  ...  This work is funded by NSF-ITR-IDM Award#0325464 titled 'SemDIS: Discovering Complex Relationships in the Semantic Web' and NSF-ITR-IDM Award#0219649 titled 'Semantic Association Identification and Knowledge  ... 
doi:10.1145/1060745.1060766 dblp:conf/www/AnyanwuMS05 fatcat:fgqycaxejbc4ddu2akb7hjfycu

A Study of Different Ranking Approaches for Semantic Search

Darshan Bhansali, Harsh Desai, Khushali Deulkar
2015 International Journal of Computer Applications  
Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching.  ...  Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search.  ...  SemRank The ranking of search results in Semantic Search is a complex task based on various factors like the importance of results, results the user expects, whether it is a comparatively new result etc  ... 
doi:10.5120/ijca2015906896 fatcat:zfztxr6sb5dnneoeo3vtsmioli

Effect of Heuristics on Serendipity in Path-Based Storytelling with Linked Data [chapter]

Laurens De Vocht, Christian Beecks, Ruben Verborgh, Erik Mannens, Thomas Seidl, Rik Van de Walle
2016 Lecture Notes in Computer Science  
Path-based storytelling with Linked Data on the Web provides users the ability to discover concepts in an entertaining and educational way.  ...  Given a query context, many state-of-the-art pathfinding approaches aim at telling a story that coincides with the user's expectations by investigating paths over Linked Data on the Web.  ...  In general, document ranking according to relevance focuses on the match degree of search keywords (without formal semantics).  ... 
doi:10.1007/978-3-319-40349-6_23 fatcat:cbjgu7yxa5bnjlrcibhqpcezoy

Relationship Web: Spinning the Web from Trailblazing to Semantic Analytics [chapter]

Amit Sheth
2008 Lecture Notes in Computer Science  
"SemRank: Ranking Complex Relationship Search Results on the Semantic Web", The 14th International World Wide Web Conference, (WWW2005), Chiba, Japan, May 10-14, 2005 Complex relationships connecting documents  ...  Sheth, Cartic Ramakrishnan: Relationship Web: Blazing Semantic Trails between Web Resources. IEEE Internet Computing, July 2007.  ...  Focusing on the relationships and the web of their interconnections over entities and facts (knowledge) implicit in data leads to a Relationship Web.  ... 
doi:10.1007/978-3-540-87877-3_2 fatcat:fkkpyyr2kfh2vjjocs35t44x7u

Rankbox: An adaptive ranking system for mining complex semantic relationships using user feedback

Na Chen, Viktor K. Prasanna
2012 2012 IEEE 13th International Conference on Information Reuse & Integration (IRI)  
This paper presents Rankbox, an adaptive ranking system for mining complex relationships on the Semantic Web.  ...  Our objective is to provide an effective ranking method for complex relationship mining, which can 1) automatically personalize ranking results according to user preferences, 2) be continuously improved  ...  One of the most fundamental tasks in relationship mining is to find complex semantic relationships between entities.  ... 
doi:10.1109/iri.2012.6302994 dblp:conf/iri/ChenP12 fatcat:rnaomu7qmneztcojxigvocbvf4

An Improved Technique For Ranking Semantic Associations

S Narayana
2013 Zenodo  
The primary focus of the search techniques in the first generation of the Web is accessing relevant documents from the Web.  ...  To demonstrate the effectiveness of the proposed method, experiments were conducted on SWETO ontology. Results show that the proposed method is more efficient than the other existing methods.  ...  The ranking of documents has been a critical component of past search engines based systems and now ranking of complex relationships between entities is becoming an important component in today"s Semantic  ... 
doi:10.5281/zenodo.1467534 fatcat:dpjdsxqv55ezxggby2yafidj5u

Discovering Relevant Semantic Associations using Relationship Weights

S. Narayana, G. P. S. Varma, A. Govardhan
2014 International Journal of Computer Applications  
Accessing relevant pages is the primary focus of the search techniques of Web 2.0 whereas accessing relevant semantic associations is the main focus of search techniques of Web 3.0 called the Semantic  ...  Semantic associations are the complex relationships between two entities such as people, places, events, publications, organizations etc.  ...  [6] proposed a method called SemRank to rank semantic associations. In this method, semantic associations are ranked based on their predictability.  ... 
doi:10.5120/15283-3913 fatcat:6njtkrvtqzeejkevvi7t66xkbu

Finding relevant semantic association paths through user-specific intermediate entities

Viswanathan V, Ilango Krishnamurthi
2012 Human-Centric Computing and Information Sciences  
In order to filter the size of results set based on user's relevance, user may introduce one or more known intermediate entities.  ...  Semantic Associations are complex relationships between entities over metadata represented in a RDF graph.  ...  For ranking the results of complex relationship searches on the semantic web, Anyanwu et al. [6] present a flexible approach called SemRank.  ... 
doi:10.1186/2192-1962-2-9 fatcat:eoxdob3lujftbfwmf45jte3lea

Learning to Rank Complex Semantic Relationships

Na Chen, Viktor K. Prasanna
2012 International Journal on Semantic Web and Information Systems (IJSWIS)  
This paper presents a novel ranking approach for complex semantic relationship (semantic association) search based on user preferences.  ...  The ranking function is then used to produce ranked lists of semantic association search results for subsequent queries from the user.  ...  Related Work Ranking on the Semantic Web Ranking knowledge on the Semantic Web has recently received a great amount of research interests.  ... 
doi:10.4018/jswis.2012100101 fatcat:2qynm67ejzhrhgpfm6etapittm

Discovering informative connection subgraphs in multi-relational graphs

Cartic Ramakrishnan, William H. Milnor, Matthew Perry, Amit P. Sheth
2005 SIGKDD Explorations  
Our heuristics are based on weighting mechanisms derived from edge semantics suggested by the RDF schema.  ...  We present an analysis of the quality of the subgraphs generated with respect to path ranking metrics.  ...  This project is funded by NSF-ITR-IDM Award#0325464 (SemDIS: Discovering Complex Relationships in the Semantic Web) and NSF-ITR-IDM Award#0219649 (Semantic Association Identification and Knowledge Discovery  ... 
doi:10.1145/1117454.1117462 fatcat:yo3b45dcnnb63etmtp6x6fbhca

Hierarchical Link Analysis for Ranking Web Data [chapter]

Renaud Delbru, Nickolai Toupikov, Michele Catasta, Giovanni Tummarello, Stefan Decker
2010 Lecture Notes in Computer Science  
DING uses links between datasets to compute dataset ranks and combines the resulting values with semantic-dependent entity ranking strategies.  ...  On the Web of Data, entities are often interconnected in a way similar to web documents. Previous works have shown how PageRank can be adapted to achieve entity ranking.  ...  Acknowledgments This material is based upon works supported by the European FP7 project Okkam -Enabling a Web of Entities (contract no. ICT-215032), and by Science Foundation Ireland under Grant No.  ... 
doi:10.1007/978-3-642-13489-0_16 fatcat:fi6yaxlwvrb6zp5gzpvt2r5gse

Interactive Relationship Discovery via the Semantic Web [chapter]

Philipp Heim, Steffen Lohmann, Timo Stegemann
2010 Lecture Notes in Computer Science  
This paper presents an approach for the interactive discovery of relationships between selected elements via the Semantic Web.  ...  Selected elements are first semi-automatically mapped to unique objects of Semantic Web datasets. These datasets are then crawled for relationships which are presented in detail and overview.  ...  for relationship search.  ... 
doi:10.1007/978-3-642-13486-9_21 fatcat:b3d6zitvvnbilnpq5gc5dzacxi

Estimating the cardinality of RDF graph patterns

Angela Maduko, Kemafor Anyanwu, Amit Sheth, Paul Schliekelman
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
A key factor in optimizing joins is determining the join order which depends on the expected cardinality of intermediate results.  ...  We present experiments on real world and synthetic datasets which confirm the feasibility of our approach.  ...  REFERENCES ( Figure 2 : 2 Performances on (a) SwetoDBLP and (b) LUBM2 [ 1 ] 1 Anyanwu, K., Maduko, A., Sheth, A. SemRank: Ranking Complex Relationship Search Results on the Semantic Web.  ... 
doi:10.1145/1242572.1242782 dblp:conf/www/MadukoASS07 fatcat:z52q6llac5fi5flvqoxtxwrkiy

BetterRelations: Collecting Association Strengths for Linked Data Triples with a Game [chapter]

Jörn Hees, Thomas Roth-Berghofer, Ralf Biedert, Benjamin Adrian, Andreas Dengel
2012 Lecture Notes in Computer Science  
In recent years, the adoption of Semantic Web technologies and the ongoing sharing of Linked Data has generated one of the world's largest knowledge bases, bringing us closer to this dream than ever.  ...  The simulation of human thinking is one of the long term goals of the Artificial Intelligence community.  ...  Swoogle [13] was one of the first search engines for the Semantic Web, using OntoRank and TermRank for ranking. OntoRank ranks RDF documents with PageRank.  ... 
doi:10.1007/978-3-642-34213-4_15 fatcat:jux55fuuqva4lpt67jlpgoomea

SPARK: Adapting Keyword Query to Semantic Search [chapter]

Qi Zhou, Chong Wang, Miao Xiong, Haofen Wang, Yong Yu
2007 Lecture Notes in Computer Science  
Semantic search promises to provide more accurate result than present-day keyword search. However, progress with semantic search has been delayed due to the complexity of its query languages.  ...  Given a keyword query, SPARK outputs a ranked list of SPARQL queries as the translation result.  ...  In the context of semantic web, there has been little work on inferring candidate query graphes from keywords, which is very important to semantic search.  ... 
doi:10.1007/978-3-540-76298-0_50 fatcat:n3xf5rg7lnd2jh7tgfsybbuuie
« Previous Showing results 1 — 15 out of 32 results