Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
221
Meta Analysis within Authorship Verification
"... In an authorship verification problem one is given writ-ing examples from an author A, and one is asked to de-termine whether or not each text in fact was written by A. In a more general form of the authorship verification prob-lem one is given a single document d only, and the question is whether o ..."
Abstract
- Add to MetaCart
for wording with context-dependent meta knowledge in their analysis. The intention of this paper is to compile an overview of the algorithmic building blocks for authorship verifica-tion. In particular, we introduce authorship verification problems as decision problems, discuss possibilities for the use
Approaches to parallel graph-based knowledge discovery
- Journal of Parallel and Distributed Computing
"... The large amount of data collected today is quickly overwhelming researchers ’ abilities to interpret the data and discover interesting patterns. Knowledge discovery and data mining systems contain the potential to automate the interpretation process, but these approaches frequently utilize computat ..."
Abstract
-
Cited by 18 (6 self)
- Add to MetaCart
computationally expensive algorithms. In particular, scientific discovery systems focus on the utilization of richer data representation, sometimes without regard for scalability. This research investigates approaches for scaling a particular knowledge discoverydata mining system, Subdue, using parallel
Program Behavior Discovery and Verification: A Graph . . .
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2009
"... Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer behavior patterns or formal models from program execution. When one tries to identify the hierarchical composition of a pr ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
substructures in a bottom-up fashion. We formulate the behavior discovery and verification problem as a graph grammar induction and parsing problem, i.e. automatically iteratively mining qualified patterns and then constructing graph rewriting rules. Furthermore, using the induced grammar to parse
Semi-supervised graph clustering: a kernel approach
, 2008
"... Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are natural for graphs, yet most semi-supervised clustering algorithms are designed for data represented as vectors. In this ..."
Abstract
-
Cited by 94 (3 self)
- Add to MetaCart
of the weighted kernel k-means objective (Dhillon et al., in Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining, 2004a). A recent theoretical connection between weighted kernel k-means and several graph clustering objectives enables us to perform semi-supervised clustering
Discovery-Driven Graph Summarization
"... Large graph datasets are ubiquitous in many domains, including social networking and biology. Graph summarization techniques are crucial in such domains as they can assist in uncovering useful insights about the patterns hidden in the underlying data. One important type of graph summarization is to ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
of summaries to identify the most interesting ones. This paper addresses both these key issues to make the interactive graph summarization approach more useful in practice. We first present a method to automatically categorize numerical attributes values by exploiting the domain knowledge hidden inside
Scalable Complex Graph Analysis with the Knowledge Discovery Toolbox
- In Int. Conference on Acoustics, Speech, and Signal Processing
, 2012
"... The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on su-percomputers using a high-level language without grappling with the difficulties of writing parallel code, calling parallel libraries, or becoming a graph expert. KDT delivers competi-tive ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on su-percomputers using a high-level language without grappling with the difficulties of writing parallel code, calling parallel libraries, or becoming a graph expert. KDT delivers competi
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
"... Nowadays, graph-based knowledge discovery algo-rithms do not consider numeric attributes (they are dis-carded in the preprocessing step, or they are treated as alphanumeric values with an exact matching criterion), with the limitation to work with domains that do not have this type of attribute or f ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Nowadays, graph-based knowledge discovery algo-rithms do not consider numeric attributes (they are dis-carded in the preprocessing step, or they are treated as alphanumeric values with an exact matching criterion), with the limitation to work with domains that do not have this type of attribute
Substructure discovery in the SUBDUE system
- In Proc. of the Workshop on Knowledge Discovery in Databases
, 1994
"... Because many databases contain or can be embellished with structural information, a method for identifying interesting and repetitive substructures is an essential component to discovering knowledge in such databases. This paper describes the SUBDUE system, which uses the minimum description length ..."
Abstract
-
Cited by 77 (3 self)
- Add to MetaCart
of background knowledgeguides SUBDUE toward appropriate substructures for a particular domain or discovery goal, and the use of an inexact graph match allows a controlled amount of deviations in the instance of a substructure concept. We describe the application of SUBDUE to a variety of domains. We also
Lexical-Syntactic and Graph-Based Features for Authorship Verification Notebook for PAN at CLEF 2013
"... Abstract. In this paper we present the results obtained by an approach submi-tted to the author identification task of PAN 2013 which uses lexical, syntactic and graph-based features for constructing a representation model of document authors. In particular, the features extracted from the graph rep ..."
Abstract
- Add to MetaCart
Abstract. In this paper we present the results obtained by an approach submi-tted to the author identification task of PAN 2013 which uses lexical, syntactic and graph-based features for constructing a representation model of document authors. In particular, the features extracted from the graph
Network Discovery and Verification with Distance Queries ∗
, 2006
"... The network discovery (verification) problem asks for a minimum subset Q ⊆ V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges of the graph. This is motivated by the common approach of combining local measurements in order to obtain maps of the Int ..."
Abstract
- Add to MetaCart
The network discovery (verification) problem asks for a minimum subset Q ⊆ V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges of the graph. This is motivated by the common approach of combining local measurements in order to obtain maps
Results 1 - 10
of
221
