Fitting Pattern Structures to Knowledge Discovery in Big Data

Abstract

Pattern structures, an extension of FCA to data with complex descriptions, propose an alternative to conceptual scaling (binarization) by giving direct way to knowledge discovery in complex data such as logical formulas, graphs, strings, tuples of numerical intervals, etc. Whereas the approach to classification with pattern structures based on preceding generation of classifiers can lead to double exponent complexity, the combination of lazy evaluation with projection approximations of initial data, randomization and parallelization, results in reduction of algorithmic complexity to low degree polynomial, and thus is feasible for big data.

DOI: 10.1007/978-3-642-38317-5_17

Extracted Key Phrases

01020201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Kuznetsov2013FittingPS, title={Fitting Pattern Structures to Knowledge Discovery in Big Data}, author={Sergei O. Kuznetsov}, booktitle={ICFCA}, year={2013} }