H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 71 Citations 18,076 193 World Ranking 782 National Ranking 30

Research.com Recognitions

Awards & Achievements

2016 - ACM Distinguished Member

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Artificial intelligence
  • Database

Laks V. S. Lakshmanan mainly focuses on Data mining, Set, Theoretical computer science, Maximization and Mathematical optimization. His work in the fields of Data mining, such as Query language, intersects with other areas such as Mobile telephony. His studies deal with areas such as Apriori algorithm and Database theory as well as Set.

His Theoretical computer science research incorporates themes from Data integrity, Cube and Quotient. Laks V. S. Lakshmanan interconnects Approximation algorithm, Greedy algorithm, Expected value, Heuristics and Approximation theory in the investigation of issues within Maximization. His studies examine the connections between Relational database and genetics, as well as such issues in Interoperability, with regards to Database.

His most cited work include:

  • Learning influence probabilities in social networks (829 citations)
  • Exploratory mining and pruning optimizations of constrained associations rules (711 citations)
  • CELF++: optimizing the greedy algorithm for influence maximization in social networks (486 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Data mining, Database, Information retrieval, Theoretical computer science and Maximization. His Data mining research includes themes of Set and Constraint. His Database research integrates issues from XML validation, XML framework, Efficient XML Interchange and XML database.

His study focuses on the intersection of Information retrieval and fields such as XML with connections in the field of Programming language. His work deals with themes such as Data modeling, Aggregate, Tree, Online analytical processing and Data integrity, which intersect with Theoretical computer science. In his work, Scalability is strongly intertwined with Social network, which is a subfield of Maximization.

He most often published in these fields:

  • Data mining (21.30%)
  • Database (19.57%)
  • Information retrieval (16.09%)

What were the highlights of his more recent work (between 2014-2021)?

  • Maximization (11.30%)
  • Approximation algorithm (9.13%)
  • Viral marketing (6.52%)

In recent papers he was focusing on the following fields of study:

Laks V. S. Lakshmanan mainly investigates Maximization, Approximation algorithm, Viral marketing, Graph and Data science. His Maximization study is related to the wider topic of Mathematical optimization. His studies in Approximation algorithm integrate themes in fields like Overhead, Computation and Minification.

His Viral marketing study necessitates a more in-depth grasp of Social network. As part of his studies on Cohesion, Laks V. S. Lakshmanan frequently links adjacent subjects like Data mining. His study in the fields of Multidimensional data under the domain of Data mining overlaps with other disciplines such as Lossless compression.

Between 2014 and 2021, his most popular works were:

  • Attribute-driven community search (95 citations)
  • Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms (60 citations)
  • Revisiting the stop-and-stare algorithms for influence maximization (57 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Programming language
  • Database

Laks V. S. Lakshmanan focuses on Graph, Community search, Maximization, Theoretical computer science and Approximation algorithm. His study in Community search is interdisciplinary in nature, drawing from both Telecommunications network, Cohesion and Data science. He combines subjects such as Social media and Viral marketing with his study of Data science.

His work carried out in the field of Maximization brings together such families of science as Social network and Product. His Theoretical computer science research is multidisciplinary, relying on both Aggregate, Recommender system, Group and Heuristic. Laks V. S. Lakshmanan has included themes like Analytics, Cluster analysis and Computation in his Approximation algorithm study.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Learning influence probabilities in social networks

Amit Goyal;Francesco Bonchi;Laks V.S. Lakshmanan.
web search and data mining (2010)

1264 Citations

Exploratory mining and pruning optimizations of constrained associations rules

Raymond T. Ng;Laks V. S. Lakshmanan;Jiawei Han;Alex Pang.
international conference on management of data (1998)

1012 Citations

CELF++: optimizing the greedy algorithm for influence maximization in social networks

Amit Goyal;Wei Lu;Laks V.S. Lakshmanan.
the web conference (2011)

709 Citations

TIMBER: A native XML database

H. V. Jagadish;S. Al-Khalifa;A. Chapman;L. V. S. Lakshmanan.
very large data bases (2002)

618 Citations

A Foundation for Multi-dimensional Databases

Marc Gyssens;Laks V. S. Lakshmanan.
very large data bases (1997)

479 Citations

SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model

Amit Goyal;Wei Lu;Laks V.S. Lakshmanan.
international conference on data mining (2011)

471 Citations

ProbView: a flexible probabilistic database system

Laks V. S. Lakshmanan;Nicola Leone;Robert Ross;V. S. Subrahmanian.
ACM Transactions on Database Systems (1997)

462 Citations

Mining frequent itemsets with convertible constraints

Jian Pei;Jiawei Han;L.V.S. Lakshmanan;L.V.S. Lakshmanan.
international conference on data engineering (2001)

433 Citations

Information and Influence Propagation in Social Networks

Wei Chen;Laks V. S. Lakshmanan;Carlos Castillo.
(2013)

376 Citations

TAX: A Tree Algebra for XML

H. V. Jagadish;Laks V. S. Lakshmanan;Divesh Srivastava;Keith Thompson.
database programming languages (2001)

374 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Laks V. S. Lakshmanan

Philip S. Yu

Philip S. Yu

University of Illinois at Chicago

Publications: 77

Jiawei Han

Jiawei Han

University of Illinois at Urbana-Champaign

Publications: 76

Carson Kai-Sang Leung

Carson Kai-Sang Leung

University of Manitoba

Publications: 73

Jian Pei

Jian Pei

Simon Fraser University

Publications: 50

Francesco Bonchi

Francesco Bonchi

Institute for Scientific Interchange

Publications: 46

Weili Wu

Weili Wu

The University of Texas at Dallas

Publications: 45

Jeffrey Xu Yu

Jeffrey Xu Yu

Chinese University of Hong Kong

Publications: 45

Hosagrahar V. Jagadish

Hosagrahar V. Jagadish

University of Michigan–Ann Arbor

Publications: 45

Divesh Srivastava

Divesh Srivastava

AT&T (United States)

Publications: 42

Charu C. Aggarwal

Charu C. Aggarwal

IBM (United States)

Publications: 40

Fosca Giannotti

Fosca Giannotti

Consiglio Nazionale delle Ricerche - CNR

Publications: 39

Dino Pedreschi

Dino Pedreschi

University of Pisa

Publications: 38

Wenfei Fan

Wenfei Fan

University of Edinburgh

Publications: 38

Anand Srinivasan

Anand Srinivasan

Business International Corporation

Publications: 37

Pierangela Samarati

Pierangela Samarati

University of Milan

Publications: 36

Something went wrong. Please try again later.