ABSTRACT
The numerous lawsuits in progress or already judged by the Brazilian Supreme Court consists of a large amount of non-structured data. This leads to a large number of hidden or unknown information, since some relationships between lawsuits are not explicit in the available data; and contributes to generate non-intuitive influences between variables, which in addition increases the degree of uncertainty on judicial outcomes. This work proposes an approach to identify possible judgment outcomes that considers the use of similarity calculations and clustering mechanisms based on lawsuits patterns. The similarity problem was tackled by analysing metadata manually extracted from lawsuits; and this work also presents an approach to detect clusters and to compile past votes. From the results, it is possible to verify lawsuits most likely outcomes and to detect their degree of uncertainty.
- M. Ackerman and S. Ben-David. Discerning linkage-based algorithms among hierarchical clustering methods. In T. Walsh, editor, IJCAI, pages 1140--1145. IJCAI/AAAI, 2011. Google ScholarDigital Library
- L. Cao, A. Bazzan, A. Symeonidis, V. Gorodetsky, G. Weiss, and P. Yu. Agents and Data Mining Interaction: 7th International Workshop, ADMI 2011, Taipei, Taiwan, May 2-6, 2011, Revised Selected Papers. LNCS sublibrary. SL 7, Artificial intelligence. Springer, 2012. Google ScholarDigital Library
- M. Gatti, P. Cavalin, S. Barbosa Neto, C. Pinhanez, C. dos Santos, D. Gribel, and A. Appel. Large-scale multi-agent-based modeling and simulation of microblogging-based online social network. In Multi-Agent-Based Simulation XIV - International Workshop, MABS 2013, Saint Paul, MN, USA, May 6-7, 2013, Revised Selected Papers, 2013.Google Scholar
- H. Surden. Machine Learning and Law. Social Science Research Network Working Paper Series, Mar. 2014.Google Scholar
Index Terms
A Clustering-based Approach to Detect Probable Outcomes of Lawsuits
Recommendations
Evolution-Based Tabu Search Approach to Automatic Clustering
Traditional clustering algorithms (e.g., the K-means algorithm and its variants) are used only for a fixed number of clusters. However, in many clustering applications, the actual number of clusters is unknown beforehand. The general solution to this ...
Self-Organizing-Map Based Clustering Using a Local Clustering Validity Index
Classical clustering methods, such as partitioning and hierarchical clustering algorithms, often fail to deliver satisfactory results, given clusters of arbitrary shapes. Motivated by a clustering validity index based on inter-cluster and intra-cluster ...
Improving a Centroid-Based Clustering by Using Suitable Centroids from Another Clustering
AbstractFast centroid-based clustering algorithms such as k-means usually converge to a local optimum. In this work, we propose a method for constructing a better clustering from two such suboptimal clustering solutions based on the fact that each ...
Comments