382 search results - page 15 / 77 » Conceptual Clustering in Structured Databases: A Practical A... |
CAEPIA
2003
Springer
14 years 1 months ago
2003
Springer
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
DAWAK
1999
Springer
14 years 22 days ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
JIIS
2000
13 years 8 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
DLOG
2003
13 years 9 months ago
2003
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...