From scientific perspective, we face the challenges of formally defining and representing meaningful and interesting relationships (which we call semantic associations), and defining the notion of quality of results similar to the familiar metrics of precision, recall and document ranking. Another challenge is the (semi) automatic construction of argument structures built on these relationships to validate or deny a given hypothesis. Additional scientific and engineering challenges include those related to the scale of storing and complex query processing of large metadata sets, with corresponding more complex data structures to represent entities and relationships, the need to utilize context to select relevant subsets of metadata to process, and new techniques that use information provenance and trust to improve ranking of relationships. These challenges call for a fresh look at indexing, query processing, ranking, as well as tractable and scalable graph algorithms that exploit heuristics. Our work proposes to address these challenges building on our preliminary results in semantic metadata extraction, practical domain-specific ontology creations, defining semantic associations, main-memory query processing, using distributed trust to enforce security policies, and knowledge representation and reasoning on the semantic web. Scientific results from SemDIS will involve detailed scenarios and an evaluation testbed, and will be measured in terms of novel techniques as well as performance metrics and measures of quality, scalability and performance for computing complex semantic relationships. Corresponding to the breadth and depth of the topics involved in the challenge undertaken, ours is a collaborative proposal involving researchers at UGA and UMBC, covering the areas of information modeling and knowledge representation, storage and database management, information retrieval and artificial intelligence.

Our effort will have broader impacts beyond the education and training of graduate students, and the publication of research findings. Results from our research will be integrated with courses we teach, both existing and new. We will use institutional mechanisms in place to seek participation of students from underrepresented groups. Datasets used for testbed evaluations and some of the targeted tools will be made public or open source, and new measures for relevance and ranking of semantic associations will provide input to future work on comparing various approaches and techniques. Our work will also gain from several academic-industry collaborations of the investigators. We will have the opportunity to leverage commercial infrastructure and raw metadata provided by Semagix and IBM and, when appropriate, technology licensing will be encouraged. The researchers will collaborate with industry, and the students will be encouraged to intern at collaborating industrial labs. Within a broader social context, emerging knowledge-centric technologies raise legitimate privacy and civil liberties concerns. Building upon past policy making experience, we will comment on potential implications of our scientific progress. This research is supported in part by an NSF award ITR 0325172, and is a collaborative effort with colleagues at U. Georgia and Wright State University . Some demos associated with our efforts to find trust using DBLP and FOAF data can be found at the project's web page. We've also developed related software systems, supported by this and other awards, such as a semantic web search engine Swoogle, Community/sentiment/trust detection systems such as Feeds that matter and PolVox, amongst others.]]> 2003-10-01T00:00:00-05:00 2008-10-01T00:00:00-05:00 2008-03-31T00:00:00-05:00 2008-03-31T00:00:00-05:00 2008-02-01T00:00:00-05:00 2007-12-10T00:00:00-05:00 2007-11-01T00:00:00-05:00 2007-10-10T00:00:00-05:00 2007-08-31T00:00:00-05:00 2007-05-01T00:00:00-05:00 2007-03-25T00:00:00-05:00 2007-03-25T00:00:00-05:00 2007-03-01T00:00:00-05:00 2007-01-07T00:00:00-05:00 2006-11-14T00:00:00-05:00 2006-10-16T00:00:00-05:00 2006-07-16T00:00:00-05:00 2006-05-23T00:00:00-05:00 2006-05-23T00:00:00-05:00 2006-05-16T00:00:00-05:00 2006-04-06T00:00:00-05:00 2006-03-27T00:00:00-05:00 2006-02-22T00:00:00-05:00 2006-02-22T00:00:00-05:00 2006-01-04T00:00:00-05:00 2005-12-31T00:00:00-05:00 2005-11-07T00:00:00-05:00 2005-11-07T00:00:00-05:00 2005-10-01T00:00:00-05:00 2005-07-19T00:00:00-05:00 2005-06-07T00:00:00-05:00 2005-04-30T00:00:00-05:00 2005-03-21T00:00:00-05:00 2005-01-03T00:00:00-05:00 2005-01-01T00:00:00-05:00 2004-11-09T00:00:00-05:00 2004-07-19T00:00:00-05:00 2004-05-22T00:00:00-05:00 2003-10-12T00:00:00-05:00 2004-06-13T00:00:00-05:00