1736 search results - page 337 / 348 » On antimagic directed graphs |
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
13 years 11 months ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Service and process-oriented systems promise to provide more effective business and work processes and more flexible and adaptable enterprise IT systems. However, the t...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
ICAIL
2007
ACM
13 years 11 months ago
2007
ACM
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...