Intertemporal Choice of Fuzzy Soft Sets

This paper first merges two noteworthy aspects of choice. On the one hand, soft sets and fuzzy soft sets are popular models that have been largely applied to decision making problems, such as real estate valuation, medical diagnosis (glaucoma, prostate cancer, etc.), data mining, or international trade. They provide crisp or fuzzy parameterized descriptions of the universe of alternatives. On the other hand, in many decisions, costs and benefits occur at different points in time. This brings about intertemporal choices, which may involve an indefinitely large number of periods. However, the literature does not provide a model, let alone a solution, to the intertemporal problem when the alternatives are described by (fuzzy) parameterizations. In this paper, we propose a novel soft set inspired model that applies to the intertemporal framework, hence it fills an important gap in the development of fuzzy soft set theory. An algorithm allows the selection of the optimal option in intertemporal choice problems with an infinite time horizon. We illustrate its application with a numerical example involving alternative portfolios of projects that a public administration may undertake. This allows us to establish a pioneering intertemporal model of choice in the framework of extended fuzzy set theorie

Soft computing techniques applied to finance

Soft computing is progressively gaining presence in the financial world. The number of real and potential applications is very large and, accordingly, so is the presence of applied research papers in the literature. The aim of this paper is both to present relevant application areas, and to serve as an introduction to the subject. This paper provides arguments that justify the growing interest in these techniques among the financial community and introduces domains of application such as stock and currency market prediction, trading, portfolio management, credit scoring or financial distress prediction areas.Publicad

Multi-view constrained clustering with an incomplete mapping between views

Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, we propose a multi-view algorithm based on constrained clustering that can operate with an incomplete mapping. Given a set of pairwise constraints in each view, our approach propagates these constraints using a local similarity measure to those instances that can be mapped to the other views, allowing the propagated constraints to be transferred across views via the partial mapping. It uses co-EM to iteratively estimate the propagation within each view based on the current clustering model, transfer the constraints across views, and then update the clustering model. By alternating the learning process between views, this approach produces a unified clustering model that is consistent with all views. We show that this approach significantly improves clustering performance over several other methods for transferring constraints and allows multi-view clustering to be reliably applied when given a limited mapping between the views. Our evaluation reveals that the propagated constraints have high precision with respect to the true clusters in the data, explaining their benefit to clustering performance in both single- and multi-view learning scenarios

Robust Rotation Synchronization via Low-rank and Sparse Matrix Decomposition

This paper deals with the rotation synchronization problem, which arises in global registration of 3D point-sets and in structure from motion. The problem is formulated in an unprecedented way as a "low-rank and sparse" matrix decomposition that handles both outliers and missing data. A minimization strategy, dubbed R-GoDec, is also proposed and evaluated experimentally against state-of-the-art algorithms on simulated and real data. The results show that R-GoDec is the fastest among the robust algorithms.Comment: The material contained in this paper is part of a manuscript submitted to CVI

Can k-NN imputation improve the performance of C4.5 with small software project data sets? A comparative evaluation

Missing data is a widespread problem that can affect the ability to use data to construct effective prediction systems. We investigate a common machine learning technique that can tolerate missing values, namely C4.5, to predict cost using six real world software project databases. We analyze the predictive performance after using the k-NN missing data imputation technique to see if it is better to tolerate missing data or to try to impute missing values and then apply the C4.5 algorithm. For the investigation, we simulated three missingness mechanisms, three missing data patterns, and five missing data percentages. We found that the k-NN imputation can improve the prediction accuracy of C4.5. At the same time, both C4.5 and k-NN are little affected by the missingness mechanism, but that the missing data pattern and the missing data percentage have a strong negative impact upon prediction (or imputation) accuracy particularly if the missing data percentage exceeds 40%

Soft set theory and topology

[EN] In this paper we study and discuss the soft set theory giving new definitions, examples, new classes of soft sets, and properties for mappings between different classes of soft sets. Furthermore, we investigate the theory of soft topological spaces and we present new definitions, characterizations, and properties concerning the soft closure, the soft interior, the soft boundary, the soft continuity, the soft open and closed maps, and the soft homeomorphism.Georgiou, DN.; Megaritis, AC. (2014). Soft set theory and topology. Applied General Topology. 15(1):93-109. doi:http://dx.doi.org/10.4995/agt.2014.2268.93109151Aktaş, H., & Çağman, N. (2007). Soft sets and soft groups. Information Sciences, 177(13), 2726-2735. doi:10.1016/j.ins.2006.12.008Ali, M. I., Feng, F., Liu, X., Min, W. K., & Shabir, M. (2009). On some new operations in soft set theory. Computers & Mathematics with Applications, 57(9), 1547-1553. doi:10.1016/j.camwa.2008.11.009Aygünoğlu, A., & Aygün, H. (2011). Some notes on soft topological spaces. Neural Computing and Applications, 21(S1), 113-119. doi:10.1007/s00521-011-0722-3Çağman, N., & Enginoğlu, S. (2010). Soft set theory and uni–int decision making. European Journal of Operational Research, 207(2), 848-855. doi:10.1016/j.ejor.2010.05.004Çağman, N., & Enginoğlu, S. (2010). Soft matrix theory and its decision making. Computers & Mathematics with Applications, 59(10), 3308-3314. doi:10.1016/j.camwa.2010.03.015Çağman, N., Karataş, S., & Enginoglu, S. (2011). Soft topology. Computers & Mathematics with Applications, 62(1), 351-358. doi:10.1016/j.camwa.2011.05.016Chen, D., Tsang, E. C. C., Yeung, D. S., & Wang, X. (2005). The parameterization reduction of soft sets and its applications. Computers & Mathematics with Applications, 49(5-6), 757-763. doi:10.1016/j.camwa.2004.10.036Feng, F., Jun, Y. B., & Zhao, X. (2008). Soft semirings. Computers & Mathematics with Applications, 56(10), 2621-2628. doi:10.1016/j.camwa.2008.05.011Hussain, S., & Ahmad, B. (2011). Some properties of soft topological spaces. Computers & Mathematics with Applications, 62(11), 4058-4067. doi:10.1016/j.camwa.2011.09.051O. Kazanci, S. Yilmaz and S. Yamak, Soft Sets and Soft BCH-Algebras, Hacettepe Journal of Mathematics and Statistics 39, no. 2 (2010), 205-217.KHARAL, A., & AHMAD, B. (2011). MAPPINGS ON SOFT CLASSES. New Mathematics and Natural Computation, 07(03), 471-481. doi:10.1142/s1793005711002025Maji, P. K., Roy, A. R., & Biswas, R. (2002). An application of soft sets in a decision making problem. Computers & Mathematics with Applications, 44(8-9), 1077-1083. doi:10.1016/s0898-1221(02)00216-xMaji, P. K., Biswas, R., & Roy, A. R. (2003). Soft set theory. Computers & Mathematics with Applications, 45(4-5), 555-562. doi:10.1016/s0898-1221(03)00016-6P. K. Maji, R. Biswas and A. R. Roy, Fuzzy soft sets, J. Fuzzy Math. 9, no. 3 (2001), 589-602.MAJUMDAR, P., & SAMANTA, S. K. (2008). SIMILARITY MEASURE OF SOFT SETS. New Mathematics and Natural Computation, 04(01), 1-12. doi:10.1142/s1793005708000908Min, W. K. (2011). A note on soft topological spaces. Computers & Mathematics with Applications, 62(9), 3524-3528. doi:10.1016/j.camwa.2011.08.068Molodtsov, D. (1999). Soft set theory—First results. Computers & Mathematics with Applications, 37(4-5), 19-31. doi:10.1016/s0898-1221(99)00056-5D. A. Molodtsov, The description of a dependence with the help of soft sets, J. Comput. Sys. Sc. Int. 40, no. 6 (2001), 977-984.D. A. Molodtsov, The theory of soft sets (in Russian), URSS Publishers, Moscow, 2004.D. A. Molodtsov, V. Y. Leonov and D. V. Kovkov, Soft sets technique and its application, Nechetkie Sistemy i Myagkie Vychisleniya 1, no. 1 (2006), 8-39.D. Pei and D. Miao, From soft sets to information systems, In: X. Hu, Q. Liu, A. Skowron, T. Y. Lin, R. R. Yager, B. Zhang, eds., Proceedings of Granular Computing, IEEE, 2 (2005), 617-621.Shabir, M., & Naz, M. (2011). On soft topological spaces. Computers & Mathematics with Applications, 61(7), 1786-1799. doi:10.1016/j.camwa.2011.02.006Shao, Y., & Qin, K. (2011). The lattice structure of the soft groups. Procedia Engineering, 15, 3621-3625. doi:10.1016/j.proeng.2011.08.678I. Zorlutuna, M. Akdag, W. K. Min and S. Atmaca, Remarks on soft topological spaces, Annals of Fuzzy Mathematics and Informatics 3, no. 2 (2012), 171-185.Zou, Y., & Xiao, Z. (2008). Data analysis approaches of soft sets under incomplete information. Knowledge-Based Systems, 21(8), 941-945. doi:10.1016/j.knosys.2008.04.00