3244 search results - page 613 / 649 » Extensions to Description Logics |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
168
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
142
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
ICFP
2001
ACM
15 years 10 months ago
2001
ACM
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...