In this work, we consider a novel problem of maximizing monotone k-submodular functions under the individual knapsack constraint () over the ground set V, which has been found numerous applications in machine learning, including data summarization and information propagation. We propose an approximation algorithm that has approximation ratio and takes O(nklog (n)/ϵ) query complexity, where ϵ is an input parameter. Alongside theoretical analysis, we conduct extensive experiments on our proposed algorithm via some applications, such as Influence Maximization and Sensor Placement. The experimental results demonstrate that our algorithm gives competitive solution quality with state-of-the-art techniques but significantly reduces the required queries.