Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Mathematics is forcing towards a consistent framework of theory development. Computer Science is an engineering discipline and sometimes suffers from ad-hoc definitions. Transac...
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much r...
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
To run a smart E-Business or provide efficient Web service, a web services composition model is needed. Web services composition refers to the process of collaborating the heterog...
An exciting trend in enterprise computing lies in the integration of applications across an organisation and even between organisations. This allows the provision of services by a...
Alan Fekete, Paul Greenfield, Dean Kuo, Julian Jan...
This paper proposes a novel way of automatically developing data warehouse configuration in rule-based CRM systems. Rule-based CRM systems assume that marketing activities are re...
Han-joon Kim, Taehee Lee, Sang-goo Lee, Jonghun Ch...
Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. We describe a novel technique for detecting search forms, ...
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...