Personalized News Recommender using Twitter

Online news reading has become a widely popular way to read news articles from news sources around the globe. With the enormous amount of news articles available, users are easily swamped by information of little interest to them. News recommender systems are one approach to help users find interesting articles to read. News recommender systems present the articles to individual users based on their interests rather than presenting articles in order of their occurrence. In this thesis, we present our research on developing personalized news recommendation system with the help of a popular micro-blogging service Twitter . The news articles are ranked based on the popularity of the article that is identified with the help of the tweets from the Twitter\u27s public timeline. Also, user profiles are built based on the user\u27s interests and the news articles are ranked by matching the characteristics of the user profile. With the help of these two approaches, we present a hybrid news recommendation model that recommends interesting news stories to the user based on their popularity and their relevance to the user profile

Developing Keywords Using Automated Clustering of Event Descriptions

This study investigated the use of automated clustering of event descriptions as a tool for developing a keyword taxonomy for a database product. Automatically-generated cluster labels were translated into keywords and domain experts reviewed the keywords alongside corresponding event descriptions. The experts evaluated the keywords for a) relevance to the event descriptions and b) goodness or use value as keywords. The results show that the keywords performed better in terms of goodness than in terms of relevance. In addition, data mining techniques showed that many of the keywords correlated closely with classifications already in use for the database

A deep learning framework for contingent liabilities risk management : predicting Brazilian labor court decisions

Estimar o resultado de um processo em litígio é crucial para muitas organizações. Uma aplicação específica são os "Passivos Contingenciais", que se referem a passivos que podem ou não ocorrer dependendo do resultado de um processo judicial em litígio. A metodologia tradicional para estimar essa probabilidade baseia-se na opinião de um advogado quem determina a possibilidade de um processo judicial ser perdido a partir de uma avaliação quantitativa. Esta tese apresenta a um modelo matemático baseado numa arquitetura de Deep Learning cujo objetivo é estimar a probabilidade de ganho ou perda de um processo de litígio, principalmente para ser utilizada na estimação de Passivos Contingenciais. A arquitetura, diferentemente do método tradicional, oferece um maior grau de confiança ao prever o resultado de um processo legal em termos de probabilidade e com um tempo de processamento de segundos. Além do resultado primário, a arquitetura estima uma amostra dos casos mais semelhantes ao processo estimado, que servem de apoio para a realização de estratégias de litígio. Nossa arquitetura foi testada em duas bases de dados de processos legais: (1) o Tribunal Europeu de Direitos Humanos (ECHR) e (2) o 4º Tribunal Regional do Trabalho brasileiro (4TRT). Ela estimou de acordo com nosso conhecimento, o melhor desempenho já publicado (precisão = 0,906) na base de dados da ECHR, uma coleção amplamente utilizada de processos legais, e é o primeiro trabalho a aplicar essa metodologia em um tribunal de trabalho brasileiro. Os resultados mostram que a arquitetura é uma alternativa adequada a ser utilizada contra o método tradicional de estimação do desfecho de um processo em litígio realizado por advogados. Finalmente, validamos nossos resultados com especialistas que confirmaram as possibilidades promissoras da arquitetura. Assim, nos incentivamos os académicos a continuar desenvolvendo pesquisas sobre modelagem matemática na área jurídica, pois é um tema emergente com um futuro promissor e aos usuários a utilizar ferramentas baseadas como a desenvolvida em nosso trabalho, pois fornecem vantagens substanciais em termos de precisão e velocidade sobre os métodos convencionais.Estimating the likely outcome of a litigation process is crucial for many organizations. A specific application is the “Contingents Liabilities,” which refers to liabilities that may or may not occur depending on the result of a pending litigation process (lawsuit). The traditional methodology for estimating this likelihood is based on the opinion from the lawyer’s experience which is based on a qualitative appreciation. This dissertation presents a mathematical modeling framework based on a Deep Learning architecture that estimates the probability outcome of a litigation process (accepted & not accepted) with a particular use on Contingent Liabilities. The framework offers a degree of confidence by describing how likely an event will occur in terms of probability and provides results in seconds. Besides the primary outcome, it offers a sample of the most similar cases to the estimated lawsuit that serve as support to perform litigation strategies. We tested our framework in two litigation process databases from: (1) the European Court of Human Rights (ECHR) and (2) the Brazilian 4th regional labor court. Our framework achieved to our knowledge the best-published performance (precision = 0.906) on the ECHR database, a widely used collection of litigation processes, and it is the first to be applied in a Brazilian labor court. Results show that the framework is a suitable alternative to be used against the traditional method of estimating the verdict outcome from a pending litigation performed by lawyers. Finally, we validated our results with experts who confirmed the promising possibilities of the framework. We encourage academics to continue developing research on mathematical modeling in the legal area as it is an emerging topic with a promising future and practitioners to use tools based as the proposed, as they provides substantial advantages in terms of accuracy and speed over conventional methods

Collected Papers (on Neutrosophic Theory and Applications), Volume VII

This seventh volume of Collected Papers includes 70 papers comprising 974 pages on (theoretic and applied) neutrosophics, written between 2013-2021 by the author alone or in collaboration with the following 122 co-authors from 22 countries: Mohamed Abdel-Basset, Abdel-Nasser Hussian, C. Alexander, Mumtaz Ali, Yaman Akbulut, Amir Abdullah, Amira S. Ashour, Assia Bakali, Kousik Bhattacharya, Kainat Bibi, R. N. Boyd, Ümit Budak, Lulu Cai, Cenap Özel, Chang Su Kim, Victor Christianto, Chunlai Du, Chunxin Bo, Rituparna Chutia, Cu Nguyen Giap, Dao The Son, Vinayak Devvrat, Arindam Dey, Partha Pratim Dey, Fahad Alsharari, Feng Yongfei, S. Ganesan, Shivam Ghildiyal, Bibhas C. Giri, Masooma Raza Hashmi, Ahmed Refaat Hawas, Hoang Viet Long, Le Hoang Son, Hongbo Wang, Hongnian Yu, Mihaiela Iliescu, Saeid Jafari, Temitope Gbolahan Jaiyeola, Naeem Jan, R. Jeevitha, Jun Ye, Anup Khan, Madad Khan, Salma Khan, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, Kifayat Ullah, Kishore Kumar P.K., Sujit Kumar De, Prasun Kumar Nayak, Malayalan Lathamaheswari, Luong Thi Hong Lan, Anam Luqman, Luu Quoc Dat, Tahir Mahmood, Hafsa M. Malik, Nivetha Martin, Mai Mohamed, Parimala Mani, Mingcong Deng, Mohammed A. Al Shumrani, Mohammad Hamidi, Mohamed Talea, Kalyan Mondal, Muhammad Akram, Muhammad Gulistan, Farshid Mofidnakhaei, Muhammad Shoaib, Muhammad Riaz, Karthika Muthusamy, Nabeela Ishfaq, Deivanayagampillai Nagarajan, Sumera Naz, Nguyen Dinh Hoa, Nguyen Tho Thong, Nguyen Xuan Thao, Noor ul Amin, Dragan Pamučar, Gabrijela Popović, S. Krishna Prabha, Surapati Pramanik, Priya R, Qiaoyan Li, Yaser Saber, Said Broumi, Saima Anis, Saleem Abdullah, Ganeshsree Selvachandran, Abdulkadir Sengür, Seyed Ahmad Edalatpanah, Shahbaz Ali, Shahzaib Ashraf, Shouzhen Zeng, Shio Gai Quek, Shuangwu Zhu, Shumaiza, Sidra Sayed, Sohail Iqbal, Songtao Shao, Sundas Shahzadi, Dragiša Stanujkić, Željko Stević, Udhayakumar Ramalingam, Zunaira Rashid, Hossein Rashmanlou, Rajkumar Verma, Luige Vlădăreanu, Victor Vlădăreanu, Desmond Jun Yi Tey, Selçuk Topal, Naveed Yaqoob, Yanhui Guo, Yee Fei Gan, Yingcang Ma, Young Bae Jun, Yuping Lai, Hafiz Abdul Wahab, Wei Yang, Xiaohong Zhang, Edmundas Kazimieras Zavadskas, Lemnaouar Zedam