Abstract

In this paper, we have made an effort to propose approachesto find similar legal judgements by extending the popu-lar techniques used in information retrieval and search en-gines. Legal judgements are complex in nature and re-fer other judgements. We have analyzed all-term, legal-term, co-citation and bibliographic coupling-based similaritymethods to find similar judgements. The experimental re-sults show that the legal-term cosine similarity method per-forms better than all-term cosine similarity method. Also,the results show that bibliographic coupling similarity methodimproves the performance over co-citation approach.

Abstract

Recently, temporal occurrences of the frequent patterns in a transactional database has been exploited as an interestingness criterion to discover a class of user-interest-based frequent patterns, called periodic-frequent patterns. Informally, a frequent pattern is said to be periodic-frequent if it occurs at regular intervals specified by the user throughout the database. The basic model of periodic-frequent patterns is based on the notion of “single constraints.” The use of this model to mine periodic-frequent patterns containing both frequent and rare items leads to a dilemma called the “rare item problem.” To confront the problem, an alternative model based on the notion of “multiple constraints” has been proposed in the literature. The periodic-frequent patterns discovered with this model do not satisfy downward closure property. As a result, it is computationally expensive to mine periodic-frequent patterns with the model. Furthermore, it has been observed that this model still generates some uninteresting patterns as periodic-frequent patterns. With this motivation, we propose an efficient model based on the notion of “multiple constraints.” The periodic-frequent patterns discovered with this model satisfy downward closure property. Hence, periodic-frequent patterns can be efficiently discovered. A pattern-growth algorithm has also been discussed for the proposed model. Experimental results show that the proposed model is effective.

Abstract

In the literature, speculation-based protocols have been pro-posed to improve the performance of read-only transactions(ROTs) over the existing two-phase locking (2PL) and snap-shot isolation(SI)-based protocols. In this paper, we havecompared the performance of asynchronous speculation-basedprotocol with 2PL and SI-based protocols through analyti-cal and simulation methods. The results show that asyn-chronous speculation-based protocol improves the perfor-mance over 2PL and SI-based protocols.

Abstract

In the Internet era, the enterprises and companies receive thousands ofresumes from the job seekers. Currently available filtering techniques and searchservices help the recruiters to filter thousands of resumes to few hundred poten-tial ones. Since these filtered resumes are similar to each other, it is difficult toidentify the potential resumes by examining each resume. We are investigatingthe issues related to the development of approaches to improve the performanceof resume selection process. We have extended the notion of special features andproposed an approach to identify resumes with special skill information. In theliterature, the notion of special features have been applied to improve the pro-cess of product selection in E-commerce environment. However, extending thenotion of special features for the development of approach to process resumes isa complex task as resumes contain unformatted text or semi-formatted text. Inthis paper, we have proposed an approach by considering only skills related in-formation of the resumes. The experimental results on the real world data-set ofresumes show that the proposed approach has the potential to improve the processof resume selection.

Abstract

In the pervasive computing era, mobile phones and personaldigital assistants are widely used for data collection. The traditional userinterfaces which are employed for data collection in personal computerenvironments are to be modified appropriately for the mobile environ-ment. Because, it is difficult to display full interface on a single mobilescreen due to the limitation of the mobile phone screen size. Interfacetailoring methods are investigated in the literature for designing user in-terface for mobile screens. In the literature, temporality-based approachis proposed for designing efficient user interface for personal computerenvironment. In this paper, we extend the notion of attribute temporalityto interface tailoring methods and propose an improved user interface de-sign approach for small screens. The analysis on the real-world datasetsshows that the proposed approach can be used for better user interfacedesign for small screens.

Abstract

Speculative locking (SL) protocols have been proposed inthe literature for improving the performance of read-onlytransactions (ROTs) without correctness and data currencyissues. In these protocols, ROTs carry out speculative ex-ecutions and update transactions (UTs) follow two-phaselocking (2PL). In these protocols, UTs are blocked if theyconflict with ROTs. To reduce blocking of UTs, semantics-based protocol has been proposed in the literature by ex-ploiting the “compensatability” property of ROTs. In thatprotocol compensatable ROTs are processed without block-ing and non-compensatable ROTs are processed by usingsynchronous speculation method. In this paper, we haveproposed a semantics-based speculative locking protocol forROTs in which non-compensatable ROTs are processed withasynchronous speculation method. The simulation resultsshow that the proposed approach improves the performanceof ROTs over other protocols

Abstract

Rare association rules are the association rules consisting ofrare items. It is difficult to mine rare association rules withthe single minimum support based approaches such as Apri-ori and FP-growth as they suffer fromrare item problem. Inthe literature, efforts has been made to extract rare associa-tion rules with multiple minimum supports. It was observedthat the multiple minimum supports-based approach stillsuffers from performance problems. As a part of proposedwork, we have analyzed the multiple minimum supports-based approach and proposed improved approaches for ex-tracting rare association rules. Experimental results showthat the proposed approaches are efficient

Abstract

The main issues in processing read-only transactions (ROTs) are correctness, data currency and performance. The popular two-phase locking (2PL) protocol processes the transactions correctly according to serializability criteria, but its performance deteriorates with data contention. To improve the performance, snapshot isolation (SI)-based approaches have been proposed. Even though SI-based approaches improve performance, however they compromise both correctness and data currency aspects. In the literature, an effort has been made to propose improved approaches to process ROTs based on the notion of speculation. The speculation-based approaches improve performance without compromising both correctness and data currency aspects. In this paper, we have extended the speculation-based protocols for processing ROTs in a distributed database systems. It has been identified that an ROT under speculation-based protocols in distributed database systems require a commit phase. In addition, additional messages are required for making speculative versions available to ROTs during the execution phase of an update transaction. In spite of these overheads, the proposed protocols reduce the waiting time of ROTs significantly by increasing the parallelism without violating both correctness and data currency aspects. The simulation experiments show that the proposed protocols significantly improve the performance over 2PL and SI-based protocols.

Abstract

By extending information and communication technologies, a personalizedagricultural advisory system called eSaguTMhas been developed in which the farmersreceive agricultural expert advice for each of their farms at regular intervals. The expertadvice is prepared by agricultural experts based on the crop status information receivedin the form of both digital photographs and text. During 2004-05, the eSaguTMsystemwas operated for 1051 cotton farms covering three villages in the state of AndhraPradesh, India. In eSaguTM, the expert advice had been delivered to every cottonfarm, once in a week. As a result, the data set consisting of about 20,000 such advicetexts had been generated. In this paper, we have carried out the cluster/textualanalysis experiments on the data set and reported interesting results concerning thedynamics of crop problems. Normally, all are cotton farms and belonging to nearbyarea/region should have faced similar problems. However, the cluster analysis of theadvices delivered on each day shows that significant number of farms are suffering fromdistinct crop production problems. The results also indicate that, a cluster of farmswhich face the same crop problem during one week face distinct crop problems duringthe subsequent weeks. Based on the results, we can conclude that it is necessaryto deliver agricultural expert advice to each farm by building agricultural advisorysystems which deliver farm-specific agricultural advices to reduce crop failures andimprove crop productivity.

Abstract

Rare association rules (or rules) are the association rules involving rare items (low frequent items). To minerare association rules efficiently, an effort has been made in CFP-growth approach to mine frequent patternsusing multiple minimum support (minsup) values. This approach is an extension of FP-growth approach tomultiple minsup values. This approach involves construction of MIS-tree and generating frequent patternsfrom the MIS-tree. The issue in CFP-growth is constructing the compact MIS-tree because CFP-growth con-siders certain items which will generate neither frequent patterns nor rules. In this paper, we propose an effi-cient approach for constructing the compact MIS-tree. To do so, the proposed approach explores the notions“least minimum support” and “infrequent child node pruning”. Experimental results on both synthetic andreal world datasets show that the proposed approach improves the performance over CFP-growth approach.