arXiv subjects

Mamata Jenamani

Publications and source records attributed to Mamata Jenamani.

12 recordsLinked to original sources

arXiv2020

Hybrid Improved Document-level Embedding (HIDE)

In recent times, word embeddings are taking a significant role in sentiment analysis. As the generation of word embeddings needs huge corpora, many applications use pretrained embeddings. In spite of the success, word embeddings suffers from certain drawbacks such as it does not capture sentiment information of a word, contextual information in terms of parts of speech tags and domain-specific information. In this work we propose HIDE a Hybrid Improved Document level Embedding which incorporates domain information, parts of speech information and sentiment information into existing word embeddings such as GloVe and Word2Vec. It combine improved word embeddings into document level embeddings. Further, Latent Semantic Analysis (LSA) has been used to represent documents as a vectors. HIDE is generated, combining LSA and document level embeddings, which is computed from improved word embeddings. We test HIDE with six different datasets and shown considerable improvement over the accuracy of existing pretrained word vectors such as GloVe and Word2Vec. We further compare our work with two existing document level sentiment analysis approaches. HIDE performs better than existing systems.

cs.CL↗

arXiv2020

An Approximate Marginal Spread Computation Approach for the Budgeted Influence Maximization with Delay

In this paper, we study the Budgeted Influence Maximization with Delay Problem, for which the number of literature are limited. We propose an approximate marginal spread computation\mbox{-}based approach for solving this problem. The proposed methodology has been implemented with three benchmark social network datasets and the obtained results are compared with the existing methods from the literature. Experimental results show that the proposed approach is able to select seed nodes which leads to more number of influential nodes with reasonable computational time.

cs.SI↗

arXiv2020

Earned Benefit Maximization in Social Networks Under Budget Constraint

Given a social network with nonuniform selection cost of the users, the problem of \textit{Budgeted Influence Maximization} (BIM in short) asks for selecting a subset of the nodes within an allocated budget for initial activation, such that due to the cascading effect, influence in the network is maximized. In this paper, we study this problem with a variation, where a set of nodes are designated as target nodes, each of them is assigned with a benefit value, that can be earned by influencing them, and our goal is to maximize the earned benefit by initially activating a set of nodes within the budget. We call this problem as the \textsc{Earned Benefit Maximization Problem}. First, we show that this problem is NP\mbox{-}Hard and the benefit function is \textit{monotone}, \textit{sub\mbox{-}modular} under the \textit{Independent Cascade Model} of diffusion. We propose an incremental greedy strategy for this problem and show, with minor modification it gives $(1-\frac{1}{\sqrt{e}})$\mbox{-}factor approximation guarantee on the earned benefit. Next, by exploiting the sub\mbox{-}modularity property of the benefit function, we improve the efficiency of the proposed greedy algorithm. Then, we propose a hop\mbox{-}based heuristic method, which works based on the computation of the `expected earned benefit' of the effective neighbors corresponding to the target nodes. Finally, we perform a series of extensive experiments with four real\mbox{-}life, publicly available social network datasets. From the experiments, we observe that the seed sets selected by the proposed algorithms can achieve more benefit compared to many existing methods. Particularly, the hop\mbox{-}based approach is found to be more efficient than the other ones for solving this problem.

cs.SI↗

arXiv2018

Threshold-Based Heuristics for Trust Inference in a Social Network

Trust among the users of a social network plays a pivotal role in item recommendation, particularly for the cold start users. Due to the sparse nature of these networks, trust information between any two users may not be always available. To infer the missing trust values, one well-known approach is path based trust estimation, which suggests a user to believe all of its neighbors in the network. In this context, we propose two threshold-based heuristics to overcome the limitation of computation for the path based trust inference. It uses the propagation phenomena of trust and decides a threshold value to select a subset of users for trust propagation. While the first heuristic creates the inferred network considering only the subset of users, the second one is able to preserve the density of the inferred network coming from all users selection. We implement the heuristics and analyze the inferred networks with two real-world datasets. We observe that the proposed threshold based heuristic can recover up to 70 \% of the paths with much less time compared to its deterministic counterpart. We also show that the heuristic based inferred trust is capable of preserving the recommendation accuracy.

cs.SI↗

arXiv2018

A Survey on Influence Maximization in a Social Network

Given a social network with diffusion probabilities as edge weights and an integer k, which k nodes should be chosen for initial injection of information to maximize influence in the network? This problem is known as Target Set Selection in a social network (TSS Problem) and more popularly, Social Influence Maximization Problem (SIM Problem). This is an active area of research in computational social network analysis domain since one and half decades or so. Due to its practical importance in various domains, such as viral marketing, target advertisement, personalized recommendation, the problem has been studied in different variants, and different solution methodologies have been proposed over the years. Hence, there is a need for an organized and comprehensive review on this topic. This paper presents a survey on the progress in and around TSS Problem. At last, it discusses current research trends and future research directions as well.

cs.SI↗

arXiv2017

Properties of a Projected Network of a Bipartite Network

Bipartite Graph is often a realistic model of complex networks where two different sets of entities are involved and relationship exist only two entities belonging to two different sets. Examples include the user-item relationship of a recommender system, actor-movie relationship of an online movie database systems. One way to compress a bipartite graph is to take unweighted or weighted one mode projection of one side vertices. Properties of this projected network are extremely important in many practical situations (say the selection process of influencing nodes for viral marketing). In this paper, we have studied the topological properties for projected network and some theoretical results are proved including the presence of cliques, connectedness for unweighted projection and maximum edge weight for weighted projected network.

cs.SI↗

arXiv2016

Development of a hybrid learning system based on SVM, ANFIS and domain knowledge: DKFIS

This paper presents the development of a hybrid learning system based on Support Vector Machines (SVM), Adaptive Neuro-Fuzzy Inference System (ANFIS) and domain knowledge to solve prediction problem. The proposed two-stage Domain Knowledge based Fuzzy Information System (DKFIS) improves the prediction accuracy attained by ANFIS alone. The proposed framework has been implemented on a noisy and incomplete dataset acquired from a hydrocarbon field located at western part of India. Here, oil saturation has been predicted from four different well logs i.e. gamma ray, resistivity, density, and clay volume. In the first stage, depending on zero or near zero and non-zero oil saturation levels the input vector is classified into two classes (Class 0 and Class 1) using SVM. The classification results have been further fine-tuned applying expert knowledge based on the relationship among predictor variables i.e. well logs and target variable - oil saturation. Second, an ANFIS is designed to predict non-zero (Class 1) oil saturation values from predictor logs. The predicted output has been further refined based on expert knowledge. It is apparent from the experimental results that the expert intervention with qualitative judgment at each stage has rendered the prediction into the feasible and realistic ranges. The performance analysis of the prediction in terms of four performance metrics such as correlation coefficient (CC), root mean square error (RMSE), and absolute error mean (AEM), scatter index (SI) has established DKFIS as a useful tool for reservoir characterization.

cs.LG↗

arXiv2016

A novel multiclassSVM based framework to classify lithology from well logs: a real-world application

Support vector machines (SVMs) have been recognized as a potential tool for supervised classification analyses in different domains of research. In essence, SVM is a binary classifier. Therefore, in case of a multiclass problem, the problem is divided into a series of binary problems which are solved by binary classifiers, and finally the classification results are combined following either the one-against-one or one-against-all strategies. In this paper, an attempt has been made to classify lithology using a multiclass SVM based framework using well logs as predictor variables. Here, the lithology is classified into four classes such as sand, shaly sand, sandy shale and shale based on the relative values of sand and shale fractions as suggested by an expert geologist. The available dataset consisting well logs (gamma ray, neutron porosity, density, and P-sonic) and class information from four closely spaced wells from an onshore hydrocarbon field is divided into training and testing sets. We have used one-against-all strategy to combine the results of multiple binary classifiers. The reported results established the superiority of multiclass SVM compared to other classifiers in terms of classification accuracy. The selection of kernel function and associated parameters has also been investigated here. It can be envisaged from the results achieved in this study that the proposed framework based on multiclass SVM can further be used to solve classification problems. In future research endeavor, seismic attributes can be introduced in the framework to classify the lithology throughout a study area from seismic inputs.

cs.LG↗

arXiv2016

A Novel Framework based on SVDD to Classify Water Saturation from Seismic Attributes

Water saturation is an important property in reservoir engineering domain. Thus, satisfactory classification of water saturation from seismic attributes is beneficial for reservoir characterization. However, diverse and non-linear nature of subsurface attributes makes the classification task difficult. In this context, this paper proposes a generalized Support Vector Data Description (SVDD) based novel classification framework to classify water saturation into two classes (Class high and Class low) from three seismic attributes seismic impedance, amplitude envelop, and seismic sweetness. G-metric means and program execution time are used to quantify the performance of the proposed framework along with established supervised classifiers. The documented results imply that the proposed framework is superior to existing classifiers. The present study is envisioned to contribute in further reservoir modeling.

cs.LG↗

arXiv2016

A One class Classifier based Framework using SVDD : Application to an Imbalanced Geological Dataset

Evaluation of hydrocarbon reservoir requires classification of petrophysical properties from available dataset. However, characterization of reservoir attributes is difficult due to the nonlinear and heterogeneous nature of the subsurface physical properties. In this context, present study proposes a generalized one class classification framework based on Support Vector Data Description (SVDD) to classify a reservoir characteristic water saturation into two classes (Class high and Class low) from four logs namely gamma ray, neutron porosity, bulk density, and P sonic using an imbalanced dataset. A comparison is carried out among proposed framework and different supervised classification algorithms in terms of g metric means and execution time. Experimental results show that proposed framework has outperformed other classifiers in terms of these performance evaluators. It is envisaged that the classification analysis performed in this study will be useful in further reservoir modeling.

cs.LG↗

arXiv2015

Quantification of sand fraction from seismic attributes using Neuro-Fuzzy approach

In this paper, we illustrate the modeling of a reservoir property (sand fraction) from seismic attributes namely seismic impedance, seismic amplitude, and instantaneous frequency using Neuro-Fuzzy (NF) approach. Input dataset includes 3D post-stacked seismic attributes and six well logs acquired from a hydrocarbon field located in the western coast of India. Presence of thin sand and shale layers in the basin area makes the modeling of reservoir characteristic a challenging task. Though seismic data is helpful in extrapolation of reservoir properties away from boreholes; yet, it could be challenging to delineate thin sand and shale reservoirs using seismic data due to its limited resolvability. Therefore, it is important to develop state-of-art intelligent methods for calibrating a nonlinear mapping between seismic data and target reservoir variables. Neural networks have shown its potential to model such nonlinear mappings; however, uncertainties associated with the model and datasets are still a concern. Hence, introduction of Fuzzy Logic (FL) is beneficial for handling these uncertainties. More specifically, hybrid variants of Artificial Neural Network (ANN) and fuzzy logic, i.e., NF methods, are capable for the modeling reservoir characteristics by integrating the explicit knowledge representation power of FL with the learning ability of neural networks. The documented results in this study demonstrate acceptable resemblance between target and predicted variables, and hence, encourage the application of integrated machine learning approaches such as Neuro-Fuzzy in reservoir characterization domain. Furthermore, visualization of the variation of sand probability in the study area would assist in identifying placement of potential wells for future drilling operations.

cs.CE↗

arXiv2015

Well Tops Guided Prediction of Reservoir Properties using Modular Neural Network Concept A Case Study from Western Onshore, India

This paper proposes a complete framework consisting pre-processing, modeling, and post-processing stages to carry out well tops guided prediction of a reservoir property (sand fraction) from three seismic attributes (seismic impedance, instantaneous amplitude, and instantaneous frequency) using the concept of modular artificial neural network (MANN). The data set used in this study comprising three seismic attributes and well log data from eight wells, is acquired from a western onshore hydrocarbon field of India. Firstly, the acquired data set is integrated and normalized. Then, well log analysis and segmentation of the total depth range into three different units (zones) separated by well tops are carried out. Secondly, three different networks are trained corresponding to three different zones using combined data set of seven wells and then trained networks are validated using the remaining test well. The target property of the test well is predicted using three different tuned networks corresponding to three zones; and then the estimated values obtained from three different networks are concatenated to represent the predicted log along the complete depth range of the testing well. The application of multiple simpler networks instead of a single one improves the prediction accuracy in terms of performance metrics such as correlation coefficient, root mean square error, absolute error mean and program execution time.

cs.NE↗