2227 search results - page 298 / 446 » Graph Mining based on a Data Partitioning Approach |
109
Voted
KDD
1995
ACM
15 years 7 months ago
1995
ACM
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
147
click to vote
PVLDB
2008
15 years 2 months ago
2008
Despite the intense interest towards realizing the Semantic Web vision, most existing RDF data management schemes are constrained in terms of efficiency and scalability. Still, th...
121
click to vote
ECRTS
2008
IEEE
15 years 10 months ago
2008
IEEE
There is a need for using virtual memory in real-time applications: using virtual addressing provides isolation between concurrent processes; in addition, paging allows the execut...
142
Voted
ECML
2007
Springer
15 years 9 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
106
click to vote
GFKL
2007
Springer
15 years 9 months ago
2007
Springer
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...