Sciweavers

47 search results - page 6 / 10
» A graph method for keyword-based selection of the top-K data...
Sort
View
IWPC
2003
IEEE
14 years 23 days ago
Generalized Selective XML Markup of Source Code Using Agile Parsing
Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly i...
James R. Cordy
CIKM
2010
Springer
13 years 4 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
AAAI
2007
13 years 9 months ago
GRIN: A Graph Based RDF Index
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....
Octavian Udrea, Andrea Pugliese, V. S. Subrahmania...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 7 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
CIKM
2009
Springer
14 years 2 months ago
Improving web page classification by label-propagation over click graphs
In this paper, we present a semi-supervised learning method for web page classification, leveraging click logs to augment training data by propagating class labels to unlabeled si...
Soo-Min Kim, Patrick Pantel, Lei Duan, Scott Gaffn...