Hahsler et al., 2010 - Google Patents
remm: Extensible markov model for data stream clustering in rHahsler et al., 2010
View PDF- Document ID
- 1500146987095060147
- Author
- Hahsler M
- Dunham M
- Publication year
- Publication venue
- Journal of Statistical Software
External Links
Snippet
Clustering streams of continuously arriving data has become an important application of data mining in recent years and efficient algorithms have been proposed by several researchers. However, clustering alone neglects the fact that data in a data stream is not …
- 230000002123 temporal effect 0 abstract description 27
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/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
-
- 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/30994—Browsing or visualization
-
- 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
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
- G06F19/22—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for sequence comparison involving nucleotides or amino acids, e.g. homology search, motif or SNP [Single-Nucleotide Polymorphism] discovery or sequence alignment
-
- 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
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2216/00—Indexing scheme relating to additional aspects of information retrieval not explicitly covered by G06F17/30 and subgroups
- G06F2216/03—Data mining
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Van de Velden et al. | Distance‐based clustering of mixed data | |
| Chávez et al. | Effective proximity retrieval by ordering permutations | |
| Zhang et al. | A quantum-inspired evolutionary algorithm based on P systems for knapsack problem | |
| Wu et al. | GAP: A graphical environment for matrix visualization and cluster analysis | |
| US8346686B2 (en) | Taxonomy-driven lumping for sequence mining | |
| KR102092263B1 (en) | How to find K poles within a certain processing time | |
| Izakian et al. | Agreement-based fuzzy C-means for clustering data with blocks of features | |
| Hahsler et al. | remm: Extensible markov model for data stream clustering in r | |
| Hong et al. | To combine steady-state genetic algorithm and ensemble learning for data clustering | |
| Guo et al. | Spatial ordering and encoding for geographic data mining and visualization | |
| Bruzzese et al. | DESPOTA: DEndrogram slicing through a pemutation test approach | |
| Hahsler et al. | Temporal structure learning for clustering massive data streams in real-time | |
| Mandal et al. | Unsupervised non-redundant feature selection: a graph-theoretic approach | |
| Baten et al. | Fast splice site detection using information content and feature reduction | |
| Godbole | Exploiting confusion matrices for automatic generation of topic hierarchies and scaling up multi-way classifiers | |
| He et al. | A novel subspace-based GMM clustering ensemble algorithm for high-dimensional data | |
| Khalilian et al. | A novel k-means based clustering algorithm for high dimensional data sets | |
| JP5081059B2 (en) | Topic visualization device, topic visualization method, topic visualization program, and recording medium recording the program | |
| Fukuyama | Adaptive gPCA: A method for structured dimensionality reduction | |
| Nabney et al. | Semisupervised learning of hierarchical latent trait models for data visualization | |
| Cordel II et al. | Fast emulation of self-organizing maps for large datasets | |
| JP2008299616A (en) | Document classification apparatus, document classification method, program, and recording medium | |
| Carreiro et al. | Towards a classification approach using meta-biclustering: impact of discretization in the analysis of expression time series | |
| Pratima et al. | Pattern recognition algorithms for cluster identification problem | |
| Pedergnana et al. | A novel supervised feature selection technique based on genetic algorithms |