[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Li et al., 2017 - Google Patents

A new closed frequent itemset mining algorithm based on GPU and improved vertical structure

Li et al., 2017

Document ID
1834612110362441557
Author
Li Y
Xu J
Yuan Y
Chen L
Publication year
Publication venue
Concurrency and Computation: Practice and Experience

External Links

Snippet

Vertical data structure is very important for closed frequent itemset mining. All closed frequent itemsets can be found by simply using the operations of AND/OR. However, it consumes a large amount of storage space, especially in the case of large‐size dataset …
Continue reading at onlinelibrary.wiley.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30587—Details of specialised database models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
Assadi et al. Massively parallel algorithms for finding well-connected components in sparse graphs
Fu et al. Fast approximate nearest neighbor search with the navigating spreading-out graph
Rathee et al. Adaptive-Miner: an efficient distributed association rule mining algorithm on Spark
Nayak et al. Graphsc: Parallel secure computation made easy
CN108292310B (en) Techniques for digital entity correlation
Rathee et al. R-Apriori: an efficient apriori based algorithm on spark
US10831759B2 (en) Efficient determination of join paths via cardinality estimation
Wang et al. Randomized algorithms accelerated over cpu-gpu for ultra-high dimensional similarity search
Li et al. A new closed frequent itemset mining algorithm based on GPU and improved vertical structure
CN104809244B (en) Data digging method and device under a kind of big data environment
Hamann et al. I/O-efficient generation of massive graphs following the LFR benchmark
Mu et al. A parallel C4. 5 decision tree algorithm based on MapReduce
Cafaro et al. Finding frequent items in parallel
Yan et al. A parallel algorithm for mining constrained frequent patterns using MapReduce
Coy et al. Deterministic massively parallel connectivity
Noraziah et al. Bvagq-ar for fragmented database replication management
Reza et al. Approximate pattern matching in massive graphs with precision and recall guarantees
Zhang et al. Sparx: Distributed outlier detection at scale
Zhang et al. A bloom filter-powered technique supporting scalable semantic service discovery in service networks
Djenouri et al. GPU-based swarm intelligence for Association Rule Mining in big databases
Bhuiyan et al. A parallel algorithm for generating a random graph with a prescribed degree sequence
Zhou A practical scalable shared-memory parallel algorithm for computing minimum spanning trees
Tench et al. GraphZeppelin: Storage-friendly sketching for connected components on dynamic graph streams
Bustio-Martínez et al. A novel multi-core algorithm for frequent itemsets mining in data streams
Alrahwan et al. ASCF: Optimization of the Apriori Algorithm Using Spark‐Based Cuckoo Filter Structure