Ankitkumar Patel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ankitkumar Patel has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Angela Chiu
AT&T Labs Research
1 shared publicationBalagangadhar G. Bathula
AT&T Labs Research
1 shared publication- Bogdan Cautis
Infocomm Technology Cluster, Singapore Institute of Technology, Singapore, Singapore
1 shared publication Joshua Reich
AT&T Labs Research
1 shared publication- Puya H. Vahabi
School of Information University of California at Berkeley Berkeley CA 94709 USA
1 shared publication Sheryl L. Woodward
AT&T Labs Research
1 shared publication
Latest Publications
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4046-4055
Influence Maximization with Fairness at Scale
In this paper, we revisit the problem of influence maximization with fairness, which aims to select k influential nodes to maximise the spread of information in a network, while ensuring that selected sensitive user attributes (e.g., gender, location, origin, race, etc.) are fairly affected, i.e., are proportionally similar between the original network and the affected users. Recent studies on this problem focused only on extremely small networks, hence the challenge remains on how to achieve a scalable solution, applicable to networks with millions or billions of nodes. We propose an approach that is based on learning node representations (embeddings) for fair spread from diffusion cascades, instead of the social connectivity, and in this way we can deal with very large graphs. We propose two data-driven approaches: (a) fairness-based participant sampling (FPS), and (b) fairness as context (FAC). Spread related user features, such as the probability of diffusing information to others, are derived from the historical information cascades, using a deep neural network. The extracted features are then used in selecting influencers that maximize the influence spread, while being also fair with respect to the chosen sensitive attributes. In FPS, fairness and cascade length information are considered independently in the decision-making process, while FAC considers these information facets jointly and takes into account correlations between them. The proposed algorithms are generic and represent the first policy-driven solutions that can be applied to arbitrary sets of sensitive attributes at scale. We evaluate the performance of our solutions on a real-world public dataset (Sina Weibo) and on a hybrid real-synthetic dataset (Digg), which exhibit all the facets that we exploit, namely diffusion network, diffusion traces, and user profiles. These experiments show that our methods outperform the state-the-art solutions in terms of spread, fairness, and scalability.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4046-4055
Open AccessInfluence Maximization with Fairness at Scale
In this paper, we revisit the problem of influence maximization with fairness, which aims to select k influential nodes to maximise the spread of information in a network, while ensuring that selected sensitive user attributes (e.g., gender, location, origin, race, etc.) are fairly affected, i.e., are proportionally similar between the original network and the affected users. Recent studies on this problem focused only on extremely small networks, hence the challenge remains on how to achieve a scalable solution, applicable to networks with millions or billions of nodes. We propose an approach that is based on learning node representations (embeddings) for fair spread from diffusion cascades, instead of the social connectivity, and in this way we can deal with very large graphs. We propose two data-driven approaches: (a) fairness-based participant sampling (FPS), and (b) fairness as context (FAC). Spread related user features, such as the probability of diffusing information to others, are derived from the historical information cascades, using a deep neural network. The extracted features are then used in selecting influencers that maximize the influence spread, while being also fair with respect to the chosen sensitive attributes. In FPS, fairness and cascade length information are considered independently in the decision-making process, while FAC considers these information facets jointly and takes into account correlations between them. The proposed algorithms are generic and represent the first policy-driven solutions that can be applied to arbitrary sets of sensitive attributes at scale. We evaluate the performance of our solutions on a real-world public dataset (Sina Weibo) and on a hybrid real-synthetic dataset (Digg), which exhibit all the facets that we exploit, namely diffusion network, diffusion traces, and user profiles. These experiments show that our methods outperform the state-the-art solutions in terms of spread, fairness, and scalability.
- 14 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 54 (10) , 109-115
Leveraging SDN to streamline metro network operations
The confluence of two recent technological trends - the maturation of ROADM technology and the rise of SDN - has produced the perfect opportunity to streamline carrier metro network operations through the use of automation. This article introduces readers to the carrier metro network and describes the challenges of automating carrier metro network operations. To this end, we illustrate both the inherent complexity of today's metro network and the legacy processes that have been put in place to manage this complexity. Our discussion covers the essential details regarding current practices in metro network operation, and touches on the economic and technical factors that have contributed to these processes remaining in place for so long. We explain how the application of lean methodology can streamline and automate metro network processes - enabling carriers to reduce work in progress, thereby simultaneously decreasing both operational expenditures and time to market.
- 14 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 54 (10) , 109-115
Leveraging SDN to streamline metro network operations
The confluence of two recent technological trends - the maturation of ROADM technology and the rise of SDN - has produced the perfect opportunity to streamline carrier metro network operations through the use of automation. This article introduces readers to the carrier metro network and describes the challenges of automating carrier metro network operations. To this end, we illustrate both the inherent complexity of today's metro network and the legacy processes that have been put in place to manage this complexity. Our discussion covers the essential details regarding current practices in metro network operation, and touches on the economic and technical factors that have contributed to these processes remaining in place for so long. We explain how the application of lean methodology can streamline and automate metro network processes - enabling carriers to reduce work in progress, thereby simultaneously decreasing both operational expenditures and time to market.