Results 11  20
of
10,618
Efficiently mining long patterns from databases
, 1998
"... We present a patternmining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real data ..."
Abstract

Cited by 465 (3 self)
 Add to MetaCart
We present a patternmining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real
ROCK: A Robust Clustering Algorithm for Categorical Attributes
 In Proc.ofthe15thInt.Conf.onDataEngineering
, 2000
"... Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than point ..."
Abstract

Cited by 430 (2 self)
 Add to MetaCart
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than
A Partial KArboretum of Graphs With Bounded Treewidth
 J. Algorithms
, 1998
"... The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes ..."
Abstract

Cited by 328 (34 self)
 Add to MetaCart
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between
Graph Saturation in Multipartite Graphs
, 2013
"... Let G be a fixed graph and let F be a family of graphs. A subgraph J of G is Fsaturated if no member of F is a subgraph of J, but for any edge e in E(G)−E(J), some element of F is a subgraph of J + e. We let ex(F, G) and sat(F, G) denote the maximum and minimum size of an Fsaturated subgraph of G, ..."
Abstract
 Add to MetaCart
, respectively. If no element of F is a subgraph of G, then sat(F, G) = ex(F, G) = E(G). In this paper, for k ≥ 3 and n ≥ 100 we determine sat(K3,K n k), where K n k is the complete balanced kpartite graph with partite sets of size n. We also give several families of constructions of Ktsaturated subgraphs
Computationally Manageable Combinatorial Auctions
, 1998
"... There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue ma ..."
Abstract

Cited by 347 (1 self)
 Add to MetaCart
maximizing set of nonconflicting bids can be a difficult one. We analyze this problem, identifying several different structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability 1 Introduction Some auctions
Directed Hypergraphs And Applications
, 1992
"... We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorith ..."
Abstract

Cited by 141 (5 self)
 Add to MetaCart
We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented
Identifying the minimal transversals of a hypergraph and related problems
 SIAM Journal on Computing
, 1995
"... The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertic ..."
Abstract

Cited by 152 (8 self)
 Add to MetaCart
of vertices is contained in or contains some edge of H, is shown to be coNPcomplete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs, is shown to be computationally equivalent to transversal hypergraph recognition, i.e., given two hypergraphs H 1; H 2, decide if the sets
The Hardness of 3Uniform Hypergraph Coloring
 In Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science
, 2002
"... We prove that coloring a 3uniform 2colorable hypergraph with any constant number of colors is NPhard. The best known algorithm [20] colors such a graph using O(n ) colors. Our result immediately implies that for any constants k > 2 and c 2 > c 1 > 1, coloring a kuniform c 1 color ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
We prove that coloring a 3uniform 2colorable hypergraph with any constant number of colors is NPhard. The best known algorithm [20] colors such a graph using O(n ) colors. Our result immediately implies that for any constants k > 2 and c 2 > c 1 > 1, coloring a kuniform c 1
Results 11  20
of
10,618