The stock market is very volatile and non-stationary and generates huge volumes of data in every second. In this article, the existing machine learning algorithms are analyzed for stock market forecasting and also a new pattern-finding algorithm for forecasting stock trend is developed. Three approaches can be used to solve the problem: fundamental analysis, technical analysis, and the machine learning. Experimental analysis done in this article shows that the machine learning could be useful for investors to make profitable decisions. In order to conduct these processes, a real-time dataset has been obtained from the Indian stock market. This article learns the model from Indian National Stock Exchange (NSE) data obtained from Yahoo API to forecast stock prices and targets to make a profit over time. In this article, two separate algorithms and methodologies are analyzed to forecast stock market trends and iteratively improve the model to achieve higher accuracy. Results are showing that the proposed pattern-based customized algorithm is more accurate (10 to 15%) as compared to other two machine learning techniques, which are also increased as the time window increases.

The recent advancements in big data and natural language processing (NLP) have necessitated proficient text mining (TM) schemes that can interpret and analyze voluminous textual data. Text summarization (TS) acts as an essential pillar within recommendation engines. Despite the prevalent use of abstractive techniques in TS, an anticipated shift towards a graph-based extractive TS (ETS) scheme is becoming apparent. The models, although simpler and less resource-intensive, are key in assessing reviews and feedback on products or services. Nonetheless, current methodologies have not fully resolved concerns surrounding complexity, adaptability, and computational demands. Thus, we propose our scheme, GETS, utilizing a graph-based model to forge connections among words and sentences through statistical procedures. The structure encompasses a post-processing stage that includes graph-based sentence clustering. Employing the Apache Spark framework, the scheme is designed for parallel execution, making it adaptable to real-world applications. For evaluation, we selected 500 documents from the WikiHow and Opinosis datasets, categorized them into five classes, and applied the recall-oriented understudying gisting evaluation (ROUGE) parameters for comparison with measures ROUGE-1, 2, and L. The results include recall scores of 0.3942, 0.0952, and 0.3436 for ROUGE-1, 2, and L, respectively (when using the clustered approach). Through a juxtaposition with existing models such as BERTEXT (with 3-gram, 4-gram) and MATCHSUM, our scheme has demonstrated notable improvements, substantiating its applicability and effectiveness in real-world scenarios.