Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Concept lattices are very useful for the task of knowledge discovery in databases. Hover, the overwhelming number of drawn formal concepts was al- ways an actual hamper towards their effective use. In the aim of filtering out, such endless lists of formal concepts, the stability metric is the most worth of mention one. In this respect, the stability computation of large concepts has been shown to be infeasible due to exponential number of object sets to be processed. The lit- erature only witnesses approaches for the stability computation that heavily rely on the existence of the Galois lattice. ,  introduce a new efficient algorithm, called DFSP, for computing the stability of a set of formal concepts without having at hand the underlying partial relation. The main thrust of the introduced algorithm stands in the smart detection of non generators and their pruning o to their fulfilment of monotony property within a given equivalence class. To the best of our knowledge, DFSP is the first algorithm that tackled such tough issue. Carried out experiments shod that DFSP efficiently computes the scalability of very large formal concepts extracted from benchmark datasets of the Data Mining field.
['Ilyes Dimassi', 'Amira Mouakher', 'Sadok Ben Yahia']
I am writing a research paper on a idea DFSP: A new algorithm for a swift computation of formal concept set stability
[{"from": "human", "value": "I am writing a research paper on a idea DFSP: A new algorithm for a swift computation of formal concept set stability"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Concept lattices are very useful for the task of knowledge discovery in databases. Hover, the overwhelming number of drawn formal concepts was al- ways an actual hamper towards their effective use. In the aim of filtering out, such endless lists of formal concepts, the stability metric is the most worth of mention one. In this respect, the stability computation of large concepts has been shown to be infeasible due to exponential number of object sets to be processed. The lit- erature only witnesses approaches for the stability computation that heavily rely on the existence of the Galois lattice. ,  introduce a new efficient algorithm, called DFSP, for computing the stability of a set of formal concepts without having at hand the underlying partial relation. The main thrust of the introduced algorithm stands in the smart detection of non generators and their pruning o to their fulfilment of monotony property within a given equivalence class. To the best of our knowledge, DFSP is the first algorithm that tackled such tough issue. Carried out experiments shod that DFSP efficiently computes the scalability of very large formal concepts extracted from benchmark datasets of the Data Mining field."}]