Sciweavers

439 search results - page 71 / 88
» Visualizing Graphs and Clusters as Maps
Sort
View
ESWS
2010
Springer
14 years 1 months ago
OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...
ICPR
2010
IEEE
14 years 17 days ago
Efficient Semantic Indexing for Image Retrieval
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...
Chandrika Pulla, Suman Karthik, C. V. Jawahar
CIKM
2010
Springer
13 years 6 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
TKDE
2011
362views more  TKDE 2011»
13 years 3 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad