Meeting with Al, 3-7-2008

From Tetherless World Wiki

Meeting with Al

Part of: Jie Bao Blog
Date: March 7, 2008
Location: Troy, NY
Participant(s): Jie Bao, Alvaro Andres Graves Fuenzalida

Details

Al introduces his research

Al is the student of Sibel Adali. Previous, he was a Master student of Claudio Gutierrez at the University of Chile, with a thesis on finding shortest-path for WordNet

Current research:

• Problem description: how to order RDF result by relevance.
• Formalization: a RDF graph is presented as a undirected graph. A result is a node in the graph. The importance of a node is represented by it "centrality", i.e., how easy it is other nodes can be reached from that node.
  • Measured by the average of the length of the shortest path from a node to all other nodes.
• Algorithm: Using Floyd-Warshall algorithm to solve all pairs shortest paths.- Complexity O(n³)
  • Based on matrix multiplication
  • To improve scalablity, use "blocked matrix": divide a large matrix into smaller blocks and compute.
• Application: may bed used in social network, e.g. on [[FOAF] data, to find important individuals.

Next step:

• Contiuning improving scalability with large graph.
  • My suggests: use graph moduarity and local clusters; use sparse matrix technique; use dynamic programming (so do not repeat executed sub-tasks)
• Ph.D. Topci ?
  • candidates: rules; policy (I briefly introduce my work on privacy-preserving reasoning)