{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:33:48Z","timestamp":1762324428994,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2019,4,3]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>This paper is an extended version of Hireche and Drias (2018) presented at the WORLD-CIST\u201918 conference. The major contribution, in this work, is defined in two phases. First of all, the use of data mining technologies and especially the tools of data preprocessing for instances of hard and complex problems prior to their resolution. The authors focus on clustering the instance aiming at reducing its complexity. The second phase is to solve the instance using the knowledge acquired in the first step and problem-solving methods. The paper aims to discuss these issues.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>Because different clustering techniques may offer different results for a data set, a prior knowledge on data helps to determine the adequate type of clustering that should be applied. The first part of this work deals with a study on data descriptive characteristics in order to better understand the data. The dispersion and distribution of the variables in the problem instances is especially explored to determine the most suitable clustering technique to apply.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>Several experiments were performed on different kinds of instances and different kinds of data distribution. The obtained results show the importance and the efficiency of the proposed appropriate preprocessing approaches prior to problem solving.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>The proposed approach is developed, in this paper, on the Boolean satisfiability problem because of its well-recognised importance, with the aim of complexity reduction which allows an easier resolution of the later problem and particularly an important time saving.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>State of the art of problem solving describes plenty of algorithms and solvers of hard problems that are still a challenge because of their complexity. The originality of this work lies on the investigation of appropriate preprocessing techniques to tackle and overcome this complexity prior to the resolution which becomes easier with an important time saving.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/dta-07-2018-0068","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:38:41Z","timestamp":1551080321000},"page":"85-107","source":"Crossref","is-referenced-by-count":4,"title":["Multidimensional appropriate clustering and DBSCAN for SAT solving"],"prefix":"10.1108","volume":"53","author":[{"given":"Celia","family":"Hireche","sequence":"first","affiliation":[]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"key":"key2021041510004587600_ref001","unstructured":"A.G. Random, available at: https:\/\/baldur.iti.kit.edu\/sat-competition-2016\/index.php?cat=benchmarks"},{"first-page":"487","article-title":"Fast algorithms for mining association rules","year":"1994","key":"key2021041510004587600_ref002"},{"first-page":"1027","article-title":"k-means++: the advantages of careful seeding","year":"2007","key":"key2021041510004587600_ref003"},{"first-page":"277","article-title":"Meta-apriori: a new algorithm for frequent pattern detection","year":"2016","key":"key2021041510004587600_ref004"},{"key":"key2021041510004587600_ref005","doi-asserted-by":"crossref","unstructured":"Bezdek, J.C. (1981), \u201cObjective function clustering\u201d, Pattern Recognition with Fuzzy Objective Function Algorithms, Springer, Boston, pp. 43-93.","DOI":"10.1007\/978-1-4757-0450-1_3"},{"first-page":"193","article-title":"Symbolic model checking without BDDs","year":"1999","key":"key2021041510004587600_ref006"},{"issue":"55","key":"key2021041510004587600_ref007","first-page":"59","article-title":"Frequent patterns mining for the satisfiability problem","volume":"55","year":"2017","journal-title":"Polibits \u2013 Research Journal on Computer Science and Computer Engineering with Applications"},{"issue":"1","key":"key2021041510004587600_ref008","first-page":"43","article-title":"A survey of binary similarity and distance measures","volume":"8","year":"2010","journal-title":"Journal of Systemics, Cybernetics and Informatics"},{"first-page":"151","article-title":"The complexity of theorem-proving procedures","year":"1971","key":"key2021041510004587600_ref009"},{"issue":"7","key":"key2021041510004587600_ref010","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theoremproving","volume":"5","year":"1962","journal-title":"Communications of the ACM"},{"first-page":"585","article-title":"Swarm intelligence with clustering for solving SAT","year":"2013","key":"key2021041510004587600_ref011"},{"first-page":"200","article-title":"Datamining techniques and swarm intelligence for problem solving: application to SAT","year":"2013","key":"key2021041510004587600_ref012"},{"first-page":"318","article-title":"Cooperative bees swarm for solving the maximum weighted satisfiability problem","year":"2005","key":"key2021041510004587600_ref013"},{"first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","year":"1996","key":"key2021041510004587600_ref014"},{"key":"key2021041510004587600_ref015","first-page":"340","article-title":"Computers and intractability: a guide to the theory of NP-completeness (series of books in the mathematical sciences)","year":"1979","journal-title":"Computers and Intractability"},{"volume-title":"Handbook of Metaheuristics","year":"2010","key":"key2021041510004587600_ref016"},{"issue":"4","key":"key2021041510004587600_ref017","first-page":"245","article-title":"ManySAT: a parallel SAT solver","volume":"6","year":"2008","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"volume-title":"Data Mining: Concepts and Techniques","year":"2011","key":"key2021041510004587600_ref018"},{"first-page":"899","article-title":"Density based clustering for satisfiability solving","year":"2018","key":"key2021041510004587600_ref019"},{"volume-title":"Stochastic Local Search: Foundations and Applications","year":"2004","key":"key2021041510004587600_ref020"},{"volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","year":"2009","key":"key2021041510004587600_ref021"},{"key":"key2021041510004587600_ref022","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","article-title":"SATenstein: automatically building local search SAT solvers from components","volume":"232","year":"2016","journal-title":"Artificial Intelligence"},{"issue":"2","key":"key2021041510004587600_ref023","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"first-page":"144","article-title":"Efficient and effective clustering methods for spatial data mining","year":"1994","key":"key2021041510004587600_ref024"},{"key":"key2021041510004587600_ref025","unstructured":"R. SAT, available at: https:\/\/baldur.iti.kit.edu\/sat-competition-2016\/index.php?cat=benchmark"},{"key":"key2021041510004587600_ref026","unstructured":"S. encoded BMC, available at: www.satcompetition.org\/2013\/downloads.shtml"},{"year":"1992","key":"key2021041510004587600_ref027","article-title":"A new method for solving hard satisfiability problems"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-07-2018-0068\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-07-2018-0068\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:13Z","timestamp":1753398913000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/53\/1\/85-107\/74231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,2,25]]},"published-print":{"date-parts":[[2019,4,3]]}},"alternative-id":["10.1108\/DTA-07-2018-0068"],"URL":"https:\/\/doi.org\/10.1108\/dta-07-2018-0068","relation":{},"ISSN":["2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2019,2,25]]}}}