Kaushik Kishore Phukon
Research Subjects
Research Interests
Kaushik Kishore Phukon has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Manashi Hazarika
Department of Agricultural Statistics, SCS College of Agriculture, Assam Agricultural University, Dhubri-783 371, Assam, India
1 shared publication
Latest Publications
- Open Access
- 12 August 2025
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 18 (29) , 2347-2352
Achieving Polynomial Time Complexity in Maximum Common Subgraph (MCS) Computation with reference to Text Modeling
Objectives: To make representation of text through directed labeled graph and also to achieve Maximum Common Subgraph (MCS) computation in limited time for the purpose of measuring similarity among the graphical objects. Method: This work has employed the maximum common subgraph approach for measuring the similarity in between two objects under representation. Findings: The proposed approach is successful in achieving polynomial time complexity, which is theoretically established in this article. The new similarity measure so developed is also more effective and efficient than the prevailing method and is shown with the help of an arbitrary example. Novelty: Achieving polynomial time complexity for the maximum common subgraph problem is a significant challenge in graph theory and algorithm design. This research has demonstrated how polynomial time complexity can be achieved in case of maximum common subgraph computation problem with directed and completely labeled graph in a methodical way. Keywords: Time Complexity, Text Representation, Graph, MCS, Word Net
- 12 August 2025
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 18 (29) , 2347-2352
Open AccessAchieving Polynomial Time Complexity in Maximum Common Subgraph (MCS) Computation with reference to Text Modeling
Objectives: To make representation of text through directed labeled graph and also to achieve Maximum Common Subgraph (MCS) computation in limited time for the purpose of measuring similarity among the graphical objects. Method: This work has employed the maximum common subgraph approach for measuring the similarity in between two objects under representation. Findings: The proposed approach is successful in achieving polynomial time complexity, which is theoretically established in this article. The new similarity measure so developed is also more effective and efficient than the prevailing method and is shown with the help of an arbitrary example. Novelty: Achieving polynomial time complexity for the maximum common subgraph problem is a significant challenge in graph theory and algorithm design. This research has demonstrated how polynomial time complexity can be achieved in case of maximum common subgraph computation problem with directed and completely labeled graph in a methodical way. Keywords: Time Complexity, Text Representation, Graph, MCS, Word Net
- Open Access
- 18 June 2024
- Published by Agricultural Research Communication Center in Indian Journal Of Agricultural Research
- No. Of
Development of ARIMA Model for Forecasting Sugarcane Production in Assam
Background: Assam is a state of northeast India which lives on agriculture. Sugarcane is one of the important cash crops grown in the state. The cultivated area of sugarcane is 29,768 hectare in the state during 2021-22 with a total production of 11,60,025 tones. Sugarcane cultivation is not evenly distributed in all the districts of Assam. The major sugarcane producing districts in state are Karbi Anglong, Nagaon, Sonitpur, Dima Hasao and Golaghat. Methods: This paper is an attempt to develop an appropriate time series model by using Box-Jenkins methodology to forecast the production of sugarcane in the state for few coming years. The study is based on secondary data collected from various publications of Directorate of Economics and Statistics, Govt. of Assam. Year wise time series data on production of sugarcane for a period of 60 years from 1961-62 to 2021-22 have been analyzed for this study. Result: The results of this study establish ARIMA(1,2,1) as an suitable model for forecasting sugarcane production in the state. The proposed forecasting model indicates an increasing trend of sugarcane production in the coming years in Assam.
- 18 June 2024
- Published by Agricultural Research Communication Center in Indian Journal Of Agricultural Research
- No. Of
Open AccessDevelopment of ARIMA Model for Forecasting Sugarcane Production in Assam
Background: Assam is a state of northeast India which lives on agriculture. Sugarcane is one of the important cash crops grown in the state. The cultivated area of sugarcane is 29,768 hectare in the state during 2021-22 with a total production of 11,60,025 tones. Sugarcane cultivation is not evenly distributed in all the districts of Assam. The major sugarcane producing districts in state are Karbi Anglong, Nagaon, Sonitpur, Dima Hasao and Golaghat. Methods: This paper is an attempt to develop an appropriate time series model by using Box-Jenkins methodology to forecast the production of sugarcane in the state for few coming years. The study is based on secondary data collected from various publications of Directorate of Economics and Statistics, Govt. of Assam. Year wise time series data on production of sugarcane for a period of 60 years from 1961-62 to 2021-22 have been analyzed for this study. Result: The results of this study establish ARIMA(1,2,1) as an suitable model for forecasting sugarcane production in the state. The proposed forecasting model indicates an increasing trend of sugarcane production in the coming years in Assam.
- Open Access
- 15 December 2020
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 13 (46) , 4573-4578
Incorporation of contextual information through Graph Modeling in Web content mining
Objectives: The objectives of this research article is to deal with the problem of web document clustering by modeling the web documents as directed completely labeled graphs that incorporate contextual information in the computation process to the extent required. The computational complexity of the MCS algorithm based on this graph model is O(n2), n being the number of nodes. As graph similarity using MCS is an NP-complete problem, so this is an important result that allows us to forgo sub-optimal approximation approaches and find the exact solution in polynomial time. Method: The first step towards this new approach of web document clustering is the representation of the web documents with the help of a directed completely labeled graph that can retain contextual information of the document under consideration. After graphical modeling of the document, the next step is the calculation of similarity between the graphical objects. For this purpose, a customized algorithm proposed as Algorithm for Maximum Common Subgraph Isomorphism (AMCSI)(1) based on a backtracking search scheme is being used. The proposed AMCSI algorithm is solving the problem of maximum common subgraph isomorphism in polynomial time. After obtaining the value for the similarity between the graphical objects we are again using a customized fuzzy-c means algorithm to produce clusters from the target set of web documents. We are using multidimensional scaling to express the distance values between the web pages (graphs) in two coordinates (x,y) and deterministic sampling to calculate the graph median in the process of fuzzy c-means clustering. Findings: We present an alternative method for web document clustering by representing the web documents as directed completely labeled graphs where the computational complexity of the MCS algorithm is O(n2)(1). A new distance measure is also developed based on the directed completely labeledgraph representation which is giving 16.9% better result than the prevailing methods(2). For the clustering purpose, we have chosen the fuzzy cmeans clustering algorithm and customizing the original algorithm to fit with graphical objects. This approach enables us to model the web documents as graphs without discarding contextual information and then cluster these graphical objects with the help of a well-established clustering algorithm. Keywords: Vector; graph; web document; subgraph; isomorphism; fuzzy; clustering
- 15 December 2020
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 13 (46) , 4573-4578
Open AccessIncorporation of contextual information through Graph Modeling in Web content mining
Objectives: The objectives of this research article is to deal with the problem of web document clustering by modeling the web documents as directed completely labeled graphs that incorporate contextual information in the computation process to the extent required. The computational complexity of the MCS algorithm based on this graph model is O(n2), n being the number of nodes. As graph similarity using MCS is an NP-complete problem, so this is an important result that allows us to forgo sub-optimal approximation approaches and find the exact solution in polynomial time. Method: The first step towards this new approach of web document clustering is the representation of the web documents with the help of a directed completely labeled graph that can retain contextual information of the document under consideration. After graphical modeling of the document, the next step is the calculation of similarity between the graphical objects. For this purpose, a customized algorithm proposed as Algorithm for Maximum Common Subgraph Isomorphism (AMCSI)(1) based on a backtracking search scheme is being used. The proposed AMCSI algorithm is solving the problem of maximum common subgraph isomorphism in polynomial time. After obtaining the value for the similarity between the graphical objects we are again using a customized fuzzy-c means algorithm to produce clusters from the target set of web documents. We are using multidimensional scaling to express the distance values between the web pages (graphs) in two coordinates (x,y) and deterministic sampling to calculate the graph median in the process of fuzzy c-means clustering. Findings: We present an alternative method for web document clustering by representing the web documents as directed completely labeled graphs where the computational complexity of the MCS algorithm is O(n2)(1). A new distance measure is also developed based on the directed completely labeledgraph representation which is giving 16.9% better result than the prevailing methods(2). For the clustering purpose, we have chosen the fuzzy cmeans clustering algorithm and customizing the original algorithm to fit with graphical objects. This approach enables us to model the web documents as graphs without discarding contextual information and then cluster these graphical objects with the help of a well-established clustering algorithm. Keywords: Vector; graph; web document; subgraph; isomorphism; fuzzy; clustering