Results 1  10
of
149,085
Graph Transactions as Processes
, 2006
"... Transactional graph transformation systems (tgtss) have been recently proposed as a mild extension of the standard dpo approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable it ..."
Abstract
 Add to MetaCart
Transactional graph transformation systems (tgtss) have been recently proposed as a mild extension of the standard dpo approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable
gRegress: Extracting Features from Graph Transactions for Regression
"... In this work we propose, gRegress, a new algorithm which given set of graph transactions and a real value associated with each graph transaction extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b) e ..."
Abstract
 Add to MetaCart
In this work we propose, gRegress, a new algorithm which given set of graph transactions and a real value associated with each graph transaction extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b
Frequent Subgraph Discovery
, 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to nontraditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract

Cited by 405 (10 self)
 Add to MetaCart
transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
An Aprioribased Algorithm for Mining Frequent Substructures from Graph Data
, 2000
"... This paper proposes a novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set. A graph transaction is represented by an adjacency matrix, and the frequent patterns appearing in the matrices are mined through the exte ..."
Abstract

Cited by 308 (7 self)
 Add to MetaCart
This paper proposes a novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set. A graph transaction is represented by an adjacency matrix, and the frequent patterns appearing in the matrices are mined through
gRegress: Extracting Features from Graph Transactions for Regression
"... In this work we propose gRegress, a new algorithm which given set a of labeled graphs and a real value associated with each graph extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b) each subgraph in ..."
Abstract
 Add to MetaCart
In this work we propose gRegress, a new algorithm which given set a of labeled graphs and a real value associated with each graph extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b) each subgraph
Agglomerative Clustering of a Search Engine Query Log
 In Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 2000
"... This paper introduces a technique for mining a collection of user transactions with an Internet search engine to discover clusters of similar queries and similar URLs. The information we exploit is "clickthrough data": each record consists of a user's query to a search engine along wi ..."
Abstract

Cited by 330 (0 self)
 Add to MetaCart
This paper introduces a technique for mining a collection of user transactions with an Internet search engine to discover clusters of similar queries and similar URLs. The information we exploit is "clickthrough data": each record consists of a user's query to a search engine along
Proceedings of the TwentyFirst International Joint Conference on Artificial Intelligence (IJCAI09) gRegress: Extracting Features from Graph Transactions for Regression
"... In this work we propose gRegress, a new algorithm which given set a of labeled graphs and a real value associated with each graph extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b) each subgraph in ..."
Abstract
 Add to MetaCart
In this work we propose gRegress, a new algorithm which given set a of labeled graphs and a real value associated with each graph extracts the complete set of subgraphs such that a) each subgraph in this set has correlation with the real value above a userspecified threshold and b) each subgraph
transaction
"... Compensation methods to support generic graph editing: A case study in automated verification of schema requirements for an advanced ..."
Abstract
 Add to MetaCart
Compensation methods to support generic graph editing: A case study in automated verification of schema requirements for an advanced
Transaction
, 2005
"... FTC Bureau of Economics working papers are preliminary materials circulated to stimulate discussion and critical comment. The analyses and conclusions set forth are those of the authors and do not necessarily reflect the views of other members of the Bureau of Economics, other Commission staff, or t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
FTC Bureau of Economics working papers are preliminary materials circulated to stimulate discussion and critical comment. The analyses and conclusions set forth are those of the authors and do not necessarily reflect the views of other members of the Bureau of Economics, other Commission staff, or the Commission itself. Upon request, single copies of the paper will be provided. References in publications to FTC Bureau of Economics working papers by FTC economists (other than acknowledgment by a writer that he has access to such unpublished materials) should be cleared with the author to protect the tentative character of these papers.
Transactions
"... Dedicated to Ugo Montanari on the occasion of his 65th birthday?? Ivan Lanese1 and Hern'an Melgratti2 1 Dipartimento di Scienze dell'Informazione, Universit`a di Bologna, ..."
Abstract
 Add to MetaCart
Dedicated to Ugo Montanari on the occasion of his 65th birthday?? Ivan Lanese1 and Hern'an Melgratti2 1 Dipartimento di Scienze dell'Informazione, Universit`a di Bologna,
Results 1  10
of
149,085