+

Kumar et al., 2018 - Google Patents

Faster approximation algorithm for the k-regret minimizing set and related problems

Kumar et al., 2018

View PDF
Document ID
8029991073278688791
Author
Kumar N
Sintos S
Publication year
Publication venue
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)

External Links

Snippet

Efficient multi-criteria decision making often requires looking at a small set of representative objects from a large collection. A recently proposed method for finding representative objects is the k-regret minimizing set (k-RMS problem). Intuitively, given a large set of …
Continue reading at epubs.siam.org (PDF) (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/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/30244—Information retrieval; Database structures therefor; File system structures therefor in image databases
    • G06F17/30247—Information retrieval; Database structures therefor; File system structures therefor in image databases based on features automatically derived from the image data
    • 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
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing 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/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • 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
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6251—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on a criterion of topology preservation, e.g. multidimensional scaling, self-organising maps
    • 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/30861—Retrieval from the Internet, e.g. browsers
    • G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6267—Classification techniques
    • G06K9/6268—Classification techniques relating to the classification paradigm, e.g. parametric or non-parametric approaches
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6267—Classification techniques
    • G06K9/6279—Classification techniques relating to the number of classes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46—Extraction of features or characteristics of the image
    • 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/10—Complex mathematical operations

Similar Documents

Publication Publication Date Title
Kumar et al. Faster approximation algorithm for the k-regret minimizing set and related problems
ÓÖݺРet al. Fast image retrieval via embeddings
Kazemi et al. Scalable deletion-robust submodular maximization: Data summarization with privacy and fairness constraints
Rathore et al. A rapid hybrid clustering algorithm for large volumes of high dimensional data
Sarma et al. Representative skylines using threshold-based preference distributions
Smorodinsky Conflict-free coloring and its applications
Agarwal et al. Efficient algorithms for k-regret minimizing sets
Ma et al. The need for unsupervised outlier model selection: A review and evaluation of internal evaluation strategies
Li et al. Context-aware hypergraph construction for robust spectral clustering
Afshani et al. On the complexity of range searching among curves
Yao et al. Reverse furthest neighbors in spatial databases
Zhou et al. Multiobjective local search for community detection in networks
Coleman et al. Sub-linear memory sketches for near neighbor search on streaming data
Liu et al. On the similarity between von Neumann graph entropy and structural information: Interpretation, computation, and applications
Yang et al. DBSCAN-MS: distributed density-based clustering in metric spaces
Wang et al. Minimum coresets for maxima representation of multidimensional data
Lee Fast k-nearest neighbor searching in static objects
Lee et al. Spatial skyline queries: exact and approximation algorithms
Huang et al. Skyline distance: a measure of multidimensional competence
Traina Jr et al. The SimilarQL framework: similarity queries in plain SQL
Sheela et al. Partition based perturbation for privacy preserving distributed data mining
Smorodinsky Conflict-free coloring and its applications
Wang et al. Improved algorithm for regret ratio minimization in multi-objective submodular maximization
van Laarhoven Generative models for local network community detection
Ding et al. Randomized greedy algorithms and composable coreset for k-center clustering with outliers
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载