For $\alpha=\omega$ the answer is no. If $H=(\omega,E)$ is a linear hypergraph, then $E$ is countable; if $H=(\omega,E)$ is any hypergraph with $E\subseteq[\omega]^\omega$ and $E$ countable, then $\chi(H)\le2$.

For $3\le\alpha\lt\omega$ the answer is yes. Let $H=(V,E)$ where $V=[\omega]^{\alpha-1}$ and $E=\{[A]^{\alpha-1}:A\in[\omega]^\alpha\}$. Then $H$ is a linear hypergraph, and $\chi(G)=\aleph_0$ because $\omega\to(\alpha)^{\alpha-1}_n\ (n\lt\omega)$, which is part of the finite Ramsey theorem.